Sciweavers

2540 search results - page 339 / 508
» Abstract Logics as Dialgebras
Sort
View
IWFM
1998
125views Formal Methods» more  IWFM 1998»
14 years 3 days ago
Mathematics for Formal Methods, a Proposal for Education Reform
It is widely recognized that there is a body of mathematics which is crucial to the underpinning of computer science, software engineering, and information and communications tech...
Mícheál Mac an Airchinnigh
WOA
2007
13 years 12 months ago
Declarative representation of curricula models: an LTL- and UML-based approach
Abstract—In this work, we present a constrained-based representation for specifying the goals of “course design”, that we call curricula model, and introduce a graphical lang...
Matteo Baldoni, Cristina Baroglio, Giuseppe Berio,...
BIRTHDAY
2008
Springer
13 years 12 months ago
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
Alexander Rabinovich, Amit Shomrat
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 12 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
BPM
2009
Springer
153views Business» more  BPM 2009»
13 years 12 months ago
DECLARE Demo: A Constraint-based Workflow Management System
Abstract. Mainstream workflow management systems are using procedural languages ranging from BPMN and EPCs to BPEL and YAWL. By demonstrating DECLARE, we will show that it is also ...
Maja Pesic, Helen Schonenberg, Wil M. P. van der A...