Sciweavers

429 search results - page 86 / 86
» Theorem Proving Languages for Verification
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
14 years 19 days ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
CAV
2009
Springer
133views Hardware» more  CAV 2009»
14 years 9 months ago
Cardinality Abstraction for Declarative Networking Applications
ity Abstraction for Declarative Networking Applications Juan A. Navarro P?erez, Andrey Rybalchenko, and Atul Singh Max Planck Institute for Software Systems (MPI-SWS) Declarative N...
Andrey Rybalchenko, Atul Singh, Juan Antonio Navar...
CI
2000
114views more  CI 2000»
13 years 8 months ago
A Guided Tour through Some Extensions of the Event Calculus
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 6 months ago
A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode
We propose a lightweight approach for certification of Java bytecode monitor inlining using proof-carrying code. The main purpose of such a framework is to enable development use ...
Mads Dam, Andreas Lundblad