Sciweavers

632 search results - page 52 / 127
» Combining programming with theorem proving
Sort
View
ICALP
2004
Springer
14 years 1 months ago
A Categorical Model for the Geometry of Interaction
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
Esfandiar Haghverdi, Philip J. Scott
POPL
2012
ACM
12 years 3 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
CNSR
2006
IEEE
136views Communications» more  CNSR 2006»
14 years 1 months ago
Combining Petri Nets and ns-2: A Hybrid Method for Analysis and Simulation
Network protocol performance and evaluation study is often carried out using a couple of widely used simulation toolkits, such as ns-2 and OPNET. These toolkits usually contain ma...
Qiang Ye, Mike H. MacGregor
TABLEAUX
1999
Springer
14 years 3 days ago
Merge Path Improvements for Minimal Model Hyper Tableaux
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
Peter Baumgartner, Joseph Douglas Horton, Bruce Sp...
SIGSOFT
2003
ACM
14 years 8 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer