Sciweavers

115 search results - page 17 / 23
» A Compact Linear Translation for Bounded Model Checking
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
14 years 9 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 4 months ago
Streaming Tree Transducers
We introduce streaming tree transducers as an analyzable and expressive model for transforming hierarchically structured data in a single pass. Given a linear encoding of the inpu...
Rajeev Alur, Loris D'Antoni
AMAST
2000
Springer
15 years 1 months ago
A New Logic for Electronic Commerce Protocols
The primary objective of this paper is to present the deÿnition of a new dynamic, linear and modal logic for security protocols. The logic is compact, expressive and formal. It a...
Kamel Adi, Mourad Debbabi, Mohamed Mejri
ICSE
2007
IEEE-ACM
15 years 9 months ago
Sequential Circuits for Relational Analysis
The Alloy tool-set has been gaining popularity as an alternative to traditional manual testing and checking for design correctness. Alloy uses a first-order relational logic for m...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
CSL
2009
Springer
15 years 4 months ago
On the Parameterised Intractability of Monadic Second-Order Logic
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
Stephan Kreutzer