Sciweavers

939 search results - page 96 / 188
» Semantic Abstraction and Quantum Computation
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
14 years 2 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
CHI
2006
ACM
14 years 10 months ago
Clipping lists and change borders: improving multitasking efficiency with peripheral information design
Information workers often have to balance many tasks and interruptions. In this work, we explore peripheral display techniques that improve multitasking efficiency by helping user...
Tara Matthews, Mary Czerwinski, George G. Robertso...
CONCUR
2009
Springer
14 years 4 months ago
Model-Checking Games for Fixpoint Logics with Partial Order Models
Abstract. We introduce model-checking games that allow local secondorder power on sets of independent transitions in the underlying partial order models where the games are played....
Julian Gutierrez, Julian C. Bradfield
PLILP
1994
Springer
14 years 2 months ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
COMSIS
2010
13 years 7 months ago
A domain-specific language for defining static structure of database applications
Abstract. In this paper we present DOMMLite - an extensible domainspecific language (DSL) for static structure definition of databaseoriented applications. The model-driven enginee...
Igor Dejanovic, Gordana Milosavljevic, Branko Peri...