Sciweavers

1856 search results - page 192 / 372
» Formal Dialectic Specification
Sort
View
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
15 years 4 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
AAI
2006
126views more  AAI 2006»
15 years 4 months ago
Theory and practice of field-based motion coordination in multiagent systems
Enabling and managing coordination activities between autonomous, possibly mobile, computing entities in dynamic computing scenarios challenges traditional approaches to distribut...
Marco Mamei, Franco Zambonelli
ENTCS
2008
91views more  ENTCS 2008»
15 years 4 months ago
Implementing Real Numbers With RZ
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
Andrej Bauer, Iztok Kavkler
ENTCS
2008
139views more  ENTCS 2008»
15 years 4 months ago
Pervasive Compiler Verification - From Verified Programs to Verified Systems
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Dirk Leinenbach, Elena Petrova
ENTCS
2006
114views more  ENTCS 2006»
15 years 4 months ago
Prototyping SOS Meta-theory in Maude
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
Mohammad Reza Mousavi, Michel A. Reniers