Sciweavers

3319 search results - page 518 / 664
» Subshifts, Languages and Logic
Sort
View
CP
2007
Springer
14 years 4 months ago
Propagation = Lazy Clause Generation
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
CSL
2007
Springer
14 years 4 months ago
A Games Model of Bunched Implications
A game semantics of the (−−∗, →)-fragment of the logic of bunched implications, BI, is presented. To date, categorical models of BI have been restricted to two kinds: funct...
Guy McCusker, David J. Pym
ECSA
2007
Springer
14 years 4 months ago
An Ontology-Based Approach for Modelling Architectural Styles
Abstract. The conceptual modelling of software architectures is of central importance for the quality of a software system. A rich modelling language is required to integrate the d...
Claus Pahl, Simon Giesecke, Wilhelm Hasselbring
FORMATS
2007
Springer
14 years 4 months ago
Counter-Free Input-Determined Timed Automata
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
Fabrice Chevalier, Deepak D'Souza, Pavithra Prabha...
IFL
2007
Springer
162views Formal Methods» more  IFL 2007»
14 years 4 months ago
Testing Erlang Refactorings with QuickCheck
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
Huiqing Li, Simon Thompson