Sciweavers

1350 search results - page 149 / 270
» Reasoning about Staged Computation
Sort
View
FSEN
2007
Springer
15 years 11 months ago
Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
Abstract. A communication protocol consists of a sequence of messages used by peer entities to communicate. Each entity in a network is equipped by at least one protocol stack. Due...
Mahdi Niamanesh, Rasool Jalili
ICALP
2007
Springer
15 years 11 months ago
Modular Algorithms for Heterogeneous Modal Logics
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
Lutz Schröder, Dirk Pattinson
ICALP
2007
Springer
15 years 11 months ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
155
Voted
ICDT
2007
ACM
112views Database» more  ICDT 2007»
15 years 11 months ago
Commutativity Analysis in XML Update Languages
Abstract. A common approach to XML updates is to extend XQuery with update operations. This approach results in very expressive languages which are convenient for users but are dif...
Giorgio Ghelli, Kristoffer Høgsbro Rose, J&...
SAS
2007
Springer
112views Formal Methods» more  SAS 2007»
15 years 11 months ago
Taming the Wrapping of Integer Arithmetic
Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent ...
Axel Simon, Andy King