Sciweavers

2272 search results - page 442 / 455
» A Calculus for
Sort
View
ESOP
1999
Springer
14 years 27 days ago
Types for Safe Locking
Abstract. A race condition is a situation where two threads manipulate a data structure simultaneously, without synchronization. Race conditions are common errors in multithreaded ...
Cormac Flanagan, Martín Abadi
STACS
1999
Springer
14 years 26 days ago
The Weakness of Self-Complementation
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
Orna Kupferman, Moshe Y. Vardi
CADE
1998
Springer
14 years 25 days ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...
ICALP
1998
Springer
14 years 25 days ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 20 days ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman