Sciweavers

1175 search results - page 32 / 235
» Abstract computability and algebraic specification
Sort
View
LICS
2010
IEEE
13 years 5 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin
ITP
2010
178views Mathematics» more  ITP 2010»
13 years 9 months ago
Developing the Algebraic Hierarchy with Type Classes in Coq
We present a new formalization of the algebraic hierarchy in Coq, exploiting its new type class mechanism to make practical a solution formerly thought infeasible. Our approach add...
Bas Spitters, Eelis van der Weegen
CONSTRAINTS
2008
117views more  CONSTRAINTS 2008»
13 years 7 months ago
Domain Specific High-Level Constraints for User Interface Layout
We present the Auckland Layout Model (ALM), a constraint-based technique for specifying 2D layout as it is used for arranging the controls in a GUI. Most GUI frameworks offer layo...
Christof Lutteroth, Robert Strandh, Gerald Weber
IEEEARES
2010
IEEE
14 years 2 months ago
Formalization of Viruses and Malware Through Process Algebras
Abstract—Abstract virology has seen the apparition of successive viral models, all based on Turing-equivalent formalisms. Considering recent malware, these are only partially cov...
Grégoire Jacob, Eric Filiol, Hervé D...
PARLE
1993
13 years 11 months ago
A Parallel Programming Style and Its Algebra of Programs
Abstract. We present a set of primitive program schemes, which together with just two basic combining forms provide a suprisingly expressive parallel programming language. The prim...
Chris Hankin, Daniel Le Métayer, David Sand...