Sciweavers

367 search results - page 55 / 74
» A Rewriting Logic Sampler
Sort
View
CONCUR
2010
Springer
13 years 9 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...
FAC
2008
92views more  FAC 2008»
13 years 8 months ago
Capture-avoiding substitution as a nominal algebra
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...
Murdoch James Gabbay, Aad Mathijssen
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 8 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
IJISEC
2008
101views more  IJISEC 2008»
13 years 8 months ago
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
Alessandro Armando, Luca Compagna
JOT
2008
200views more  JOT 2008»
13 years 7 months ago
Applying Model Checking to Concurrent UML Models
We present, in this paper, a framework supporting a formal verification of concurrent UML models using the Maude language. We consider both static and dynamic features of concurre...
Patrice Gagnon, Farid Mokhati, Mourad Badri