Sciweavers

598 search results - page 64 / 120
» Generic Trace Theory
Sort
View
ICFEM
2007
Springer
14 years 2 months ago
Testing for Refinement in CSP
Abstract. CSP is a well-established formalism for modelling and verification of concurrent reactive systems based on refinement. Consolidated denotational models and an effective t...
Ana Cavalcanti, Marie-Claude Gaudel
CCS
2008
ACM
14 years 5 days ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers
ENTCS
2010
141views more  ENTCS 2010»
13 years 10 months ago
Debugging as a Science, that too, when your Program is Changing
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...
Abhik Roychoudhury
ENTCS
2006
162views more  ENTCS 2006»
13 years 10 months ago
Continuous Functions on Final Coalgebras
It can be traced back to Brouwer that continuous functions of type StrA B, where StrA is the type of infinite streams over elements of A, can be represented by well founded, Abra...
Neil Ghani, Peter Hancock, Dirk Pattinson
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 10 months ago
Normalisation Control in Deep Inference Via Atomic Flows
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
Alessio Guglielmi, Tom Gundersen