Sciweavers

797 search results - page 137 / 160
» Eliminating Proofs from Programs
Sort
View
RTA
2010
Springer
14 years 1 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
FM
2006
Springer
127views Formal Methods» more  FM 2006»
14 years 1 months ago
Using Domain-Independent Problems for Introducing Formal Methods
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
Raymond T. Boute
UML
2000
Springer
14 years 1 months ago
Dynamic Meta Modeling: A Graphical Approach to the Operational Semantics of Behavioral Diagrams in UML
In this paper, dynamic meta modeling is proposed as a new approach to the operational semantics of behavioral UML diagrams. The dynamic meta model extends the well-known static met...
Gregor Engels, Jan Hendrik Hausmann, Reiko Heckel,...
WOA
2007
13 years 11 months ago
An Agent Based Solution for Dispatching Items in a Distributed Environment
—This paper describes Herald, an agent based toolkit for dispatching and processing items in a distributed environment. Herald is suitable for scenarios where the process could b...
Christian Vecchiola, Alberto Grosso, Andrea Passad...
ECCC
2010
89views more  ECCC 2010»
13 years 10 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky