Sciweavers

71 search results - page 11 / 15
» Some Domain Theory and Denotational Semantics in Coq
Sort
View
POPL
2004
ACM
14 years 7 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
JUCS
2002
110views more  JUCS 2002»
13 years 7 months ago
Generation of Constants and Synchronization of Finite Automata
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
Arto Salomaa
ICTAI
2009
IEEE
14 years 2 months ago
Translation of an Argumentation Framework into a CP-Boolean Game
Abstract—There already exist some links between argumentation and game theory. For instance, dynamic games can be used for simulating interactions between agents in an argumentat...
Elise Bonzon, Caroline Devred, Marie-Christine Lag...
AEPIA
2002
159views more  AEPIA 2002»
13 years 7 months ago
Analysing Rough Sets weighting methods for Case-Based Reasoning Systems
Case-Based Reasoning systems retrieve cases using a similarity function based on the K-NN or some derivatives. These functions are sensitive to irrelevant, interacting or noisy fe...
Maria Salamó, Elisabet Golobardes
ACMSE
2010
ACM
13 years 5 months ago
Automatic generation of model traversals from metamodel definitions
Developing software from models is a growing practice and there exist many model-based tools (e.g., model editors, model interpreters) for supporting model-driven engineering. Eve...
Tomaz Lukman, Marjan Mernik, Zekai Demirezen, Barr...