Sciweavers

7139 search results - page 1277 / 1428
» Language Engineering in Practice
Sort
View
FOSSACS
2010
Springer
15 years 11 months ago
Completeness for Algebraic Theories of Local State
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
Sam Staton
FOSSACS
2010
Springer
15 years 11 months ago
CIA Structures and the Semantics of Recursion
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
Stefan Milius, Lawrence S. Moss, Daniel Schwencke
HICSS
2009
IEEE
151views Biometrics» more  HICSS 2009»
15 years 11 months ago
Integrating Formal Analysis and Design to Preserve Security Properties
The use of formal methods has long been advocated in the development of secure systems. Yet, methods for deriving design from requirements that guarantee retention of the intended...
Riham Hassan, Shawn A. Bohner, Sherif El-Kassas, M...
SAC
2009
ACM
15 years 11 months ago
LTS semantics for use case models
Formalization is a necessary precondition for the specification of precise and unambiguous use case models, which serve as reference points for the design and implementation of so...
Daniel Sinnig, Patrice Chalin, Ferhat Khendek
CP
2009
Springer
15 years 11 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
« Prev « First page 1277 / 1428 Last » Next »