Sciweavers

54 search results - page 6 / 11
» Symbolic Negotiation with Linear Logic
Sort
View
CONCUR
2001
Springer
14 years 4 days ago
Extended Temporal Logic Revisited
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
PLDI
2011
ACM
12 years 10 months ago
Separation logic + superposition calculus = heap theorem prover
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
Juan Antonio Navarro Pérez, Andrey Rybalche...
SIGSOFT
2006
ACM
14 years 8 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
DIAGRAMS
2004
Springer
13 years 11 months ago
Towards a Default Reading for Constraint Diagrams
Constraint diagrams are a diagrammatic notation which may be used to express logical constraints. They were designed to complement the Unified Modeling Language in the development ...
Andrew Fish, John Howse
SAS
2004
Springer
134views Formal Methods» more  SAS 2004»
14 years 1 months ago
Towards Declarative Programming for Web Services
ness Refinement in Abstract Symbolic Trajectory Evaluation . . . . 38 Mila Dalla Preda Constraint-Based Linear-Relations Analysis . . . . . . . . . . . . . . . . . . . . . . . . ....
Sheila A. McIlraith