1216 search results - page 16 / 244 » Hybrid type checking |
TPHOL
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract. We present a formal treatment of normalization by evaluation in type theory. The involved semantics of simply-typed λ-calculus is exactly the simply typed fragment of th...
VMCAI
2005
Springer
15 years 3 months ago
2005
Springer
Bounded model checking (BMC) is an automatic verification method that is based on a finite unfolding of the system’s transition relation. BMC has been successfully applied, in ...
COMPSAC
2009
IEEE
15 years 4 months ago
2009
IEEE
Developing concurrent programs is intrinsically difficult. They are subject to programming errors that are not present in traditional sequential programs. Our current work is to ...
CAV
2005
Springer
15 years 3 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
ISOLA
2004
Springer
15 years 3 months ago
2004
Springer
We study consistency, satisfiability, and validity problems for collectively model checking a set of views endowed with labelled transitions, hybrid constraints on states, and ato...