Sciweavers

101 search results - page 10 / 21
» Towards Integration of State Machines and Object-Oriented La...
Sort
View
ACL
1997
15 years 1 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
POPL
2000
ACM
15 years 3 months ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu
LISP
2002
81views more  LISP 2002»
14 years 11 months ago
Secure Information Flow via Linear Continuations
Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages...
Steve Zdancewic, Andrew C. Myers
ROBOCUP
2000
Springer
120views Robotics» more  ROBOCUP 2000»
15 years 3 months ago
Towards a Logical Approach for Soccer Agents Engineering
Building agents for a scenario such as the RoboCup simulation league requires not only methodologies for implementing high-level complex behavior, but also the careful and efficien...
Jan Murray, Oliver Obst, Frieder Stolzenburg
ENTCS
2007
174views more  ENTCS 2007»
14 years 11 months ago
Quantum Patterns and Types for Entanglement and Separability
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
Simon Perdrix