Sciweavers

213 search results - page 29 / 43
» A framework for checking proofs naturally
Sort
View
CONCUR
1999
Springer
13 years 11 months ago
From Synchrony to Asynchrony
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...
Albert Benveniste, Benoît Caillaud, Paul Le ...
IJCAI
2007
13 years 9 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
ENTCS
2006
124views more  ENTCS 2006»
13 years 7 months ago
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Abstract. Nelson and Oppen provided a methodology for modularly combining decision procedures for individual theories to construct a decision procedure for a combination of theorie...
Shuvendu K. Lahiri, Madanlal Musuvathi
LICS
2010
IEEE
13 years 6 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...
FMCO
2009
Springer
134views Formal Methods» more  FMCO 2009»
13 years 5 months ago
Verification of Context-Dependent Channel-Based Service Models
Abstract. The paradigms of service-oriented computing and modeldriven development are becoming of increasing importance in the field of software engineering. According to these par...
Natallia Kokash, Christian Krause, Erik P. de Vink