Sciweavers

455 search results - page 57 / 91
» The Linear Logical Abstract Machine
Sort
View
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 4 days ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...
ICFP
2002
ACM
15 years 9 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
ENTCS
2007
85views more  ENTCS 2007»
14 years 9 months ago
Stochastic Modelling of Communication Protocols from Source Code
A major development in qualitative model checking was the jump to verifying properties of source code directly, rather than requiring a separately specified model. We describe an...
Michael J. A. Smith
SAC
2009
ACM
15 years 4 months ago
Runtime monitoring of web service choreographies using streaming XML
A wide range of web service choreography constraints on the content and sequentiality of messages can be translated into Linear Temporal Logic (LTL). Although they can be statical...
Sylvain Hallé, Roger Villemaire
CHARME
2005
Springer
91views Hardware» more  CHARME 2005»
15 years 3 months ago
Temporal Modalities for Concisely Capturing Timing Diagrams
Timing diagrams are useful for capturing temporal specifications in which all mentioned events are required to occur. We first show that translating timing diagrams with both par...
Hana Chockler, Kathi Fisler