Sciweavers

178 search results - page 14 / 36
» A simple implementation of grammar libraries
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
13 years 11 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
IPPS
2006
IEEE
14 years 1 months ago
Seekable sockets: a mechanism to reduce copy overheads in TCP-based messaging
This paper extends the traditional socket interface to TCP/IP communication with the ability to seek rather than simply receive data in order. Seeking on a TCP socket allows a use...
Chase Douglas, Vijay S. Pai
FM
2006
Springer
148views Formal Methods» more  FM 2006»
13 years 11 months ago
Automatic Translation from Circus to Java
Abstract. Circus is a combination of Z and CSP that supports the development of state-rich reactive systems based on refinement. In this paper we present JCircus, a tool that autom...
Angela Freitas, Ana Cavalcanti
DNA
2005
Springer
132views Bioinformatics» more  DNA 2005»
14 years 28 days ago
DNA Recombination by XPCR
The first step of the Adleman-Lipton extract model in DNA computing is the combinatorial generation of libraries. In this paper a new method is proposed for generating a initial p...
Giuditta Franco, Vincenzo Manca, Cinzia Giagulli, ...
ICFEM
2004
Springer
14 years 23 days ago
Software Model Checking Using Linear Constraints
Iterative abstraction refinement has emerged in the last few years as the leading approach to software model checking. In this context Boolean programs are commonly employed as si...
Alessandro Armando, Claudio Castellini, Jacopo Man...