Sciweavers

852 search results - page 125 / 171
» entcs 2010
Sort
View
110
Voted
ENTCS
2010
90views more  ENTCS 2010»
15 years 15 days ago
Recursive Program Schemes and Context-Free Monads
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
Jirí Adámek, Stefan Milius, Jiri Vel...
ENTCS
2010
99views more  ENTCS 2010»
15 years 15 days ago
Describing Secure Interfaces with Interface Automata
Interface automata are a model that allows for the representation of stateful interfaces. In this paper we introduce a variant of interface automata, which we call interface struc...
Matias Lee, Pedro R. D'Argenio
ENTCS
2010
119views more  ENTCS 2010»
15 years 15 days ago
A Tableau Method for Checking Rule Admissibility in S4
Rules that are admissible can be used in any derivations in any axiomatic system of a logic. In this paper we introduce a method for checking the admissibility of rules in the mod...
Sergey Babenyshev, Vladimir V. Rybakov, Renate A. ...
111
Voted
ENTCS
2010
82views more  ENTCS 2010»
15 years 15 days ago
A Strict-Observational Interface Theory for Analysing Service Orchestrations
Service oriented computing is an accepted architectural style for developing large, distributed software systems. A particular promise of such architectures is service orchestrati...
Philip Mayer, Andreas Schroeder, Sebastian S. Baue...
98
Voted
ENTCS
2010
84views more  ENTCS 2010»
15 years 15 days ago
Resource Modeling for Timed Creol Models
This paper describes the semantics of a timed, resource-constrained extension of the Creol modeling language. Creol is an object-oriented modeling language with a design that is s...
Rudolf Schlatte, Bernhard K. Aichernig, Andreas Gr...