Sciweavers

1418 search results - page 188 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
CALCO
2005
Springer
114views Mathematics» more  CALCO 2005»
15 years 10 months ago
Towards a Coalgebraic Semantics of the Ambient Calculus
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
Daniel Hausmann, Till Mossakowski, Lutz Schrö...
135
Voted
ICALP
2005
Springer
15 years 10 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
MOZ
2004
Springer
15 years 10 months ago
Strasheela: Design and Usage of a Music Composition Environment Based on the Oz Programming Model
Strasheela provides a means for the composer to create a symbolic score by formally describing it in a rule-based way. The environment defines a rich music representation for comp...
Torsten Anders, Christina Anagnostopoulou, Michael...
DBPL
2003
Springer
130views Database» more  DBPL 2003»
15 years 10 months ago
Attribute Grammars for Scalable Query Processing on XML Streams
We introduce the new notion of XML Stream Attribute Grammars (XSAGs). XSAGs are the first scalable query language for XML streams (running strictly in linear time with bounded mem...
Christoph Koch, Stefanie Scherzinger
ASM
2008
ASM
15 years 7 months ago
Model Checking Event-B by Encoding into Alloy
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
Paulo J. Matos, João Marques-Silva