289 search results - page 39 / 58 » Formal Verification in a Commercial Setting |
AIML
2008
14 years 11 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
CADE
2005
Springer
15 years 10 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
ASE
2002
14 years 9 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
We describe a Markov chain Monte Carlo (MCMC)-based algorithm for sampling solutions to mixed Boolean/integer constraint problems. The focus of this work differs in two points from...
ICDCS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper introduces a mechanism for establishing policies for electronic commerce in a uni ed and secure manner. A commercial policy can be viewed as the embodiment of a contrac...