Sciweavers

4340 search results - page 727 / 868
» Formal Methods and Cryptography
Sort
View
IFL
2007
Springer
141views Formal Methods» more  IFL 2007»
15 years 11 months ago
Partial Parsing: Combining Choice with Commitment
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
Malcolm Wallace
121
Voted
IFM
2007
Springer
101views Formal Methods» more  IFM 2007»
15 years 11 months ago
Translating FSP into LOTOS and Networks of Automata
Many process calculi have been proposed since Robin Milner and Tony Hoare opened the way more than 25 years ago. Although they are based on the same kernel of operators, most of th...
Gwen Salaün, Jeff Kramer, Frédé...
KI
2007
Springer
15 years 11 months ago
Extending Markov Logic to Model Probability Distributions in Relational Domains
Abstract. Markov logic, as a highly expressive representation formalism that essentially combines the semantics of probabilistic graphical models with the full power of first-orde...
Dominik Jain, Bernhard Kirchlechner, Michael Beetz
MIDDLEWARE
2007
Springer
15 years 11 months ago
Rule-based reasoning about qualitative spatiotemporal relations
This paper is about a novel rule-based approach for reasoning about qualitative spatiotemporal relations among technology-rich autonomous objects, to which we refer to as artifact...
Clemens Holzmann
VAMOS
2007
Springer
15 years 11 months ago
Variability Models Must Not be Invariant!
Variability modeling techniques are used to specify variable aspects of members of a family of related software artifacts. Instances of variability models are then used to effici...
Elmar Jürgens, Markus Pizka