Sciweavers

681 search results - page 37 / 137
» A Logic for True Concurrency
Sort
View
CONCUR
2010
Springer
14 years 10 months ago
Termination in Impure Concurrent Languages
Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it po...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
JLP
2000
109views more  JLP 2000»
14 years 9 months ago
Demand Transformation Analysis for Concurrent Constraint Programs
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...
Moreno Falaschi, Patrick Hicks, William H. Winsbor...
TABLEAUX
2007
Springer
15 years 3 months ago
Bounded Model Checking with Description Logic Reasoning
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
AMAST
1991
Springer
15 years 1 months ago
Event Spaces and their Linear Logic
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
Vaughan R. Pratt
ICCAD
1994
IEEE
127views Hardware» more  ICCAD 1994»
15 years 1 months ago
Synthesis of concurrent system interface modules with automatic protocol conversion generation
-- We describe a new high-level compiler called Integral fordesigning system interface modules. The inputis a high-levelconcurrent algorithmic specification that can model complex ...
Bill Lin, Steven Vercauteren