Sciweavers

656 search results - page 112 / 132
» A Formalization of Transition P Systems
Sort
View
TOPLAS
2008
138views more  TOPLAS 2008»
15 years 7 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
LICS
2007
IEEE
16 years 1 months ago
Principles of Superdeduction
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...
Paul Brauner, Clément Houtmann, Claude Kirc...
APCCM
2006
15 years 9 months ago
On the suitability of UML 2.0 activity diagrams for business process modelling
UML is posited as the "swiss army knife" for systems modelling and design activities. It embodies a number of modelling formalisms that have broad applicability in captu...
Nick Russell, Wil M. P. van der Aalst, Arthur H. M...
FCT
2005
Springer
16 years 1 months ago
Leftist Grammars and the Chomsky Hierarchy
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...
Tomasz Jurdzinski, Krzysztof Lorys
IS
2007
15 years 7 months ago
A configurable reference modelling language
Enterprise Systems (ES) are comprehensive off-the-shelf packages that have to be configured to suit the requirements of an organization. Most ES solutions provide reference models...
Michael Rosemann, Wil M. P. van der Aalst