Sciweavers

3824 search results - page 390 / 765
» Geometry Constructions Language
Sort
View
ISSTA
2004
ACM
15 years 11 months ago
Faster constraint solving with subtypes
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
Jonathan Edwards, Daniel Jackson, Emina Torlak, Vi...
134
Voted
IWMM
2004
Springer
92views Hardware» more  IWMM 2004»
15 years 11 months ago
Memory accounting without partitions
Operating systems account for memory consumption and allow for termination at the level of individual processes. As a result, if one process consumes too much memory, it can be te...
Adam Wick, Matthew Flatt
AOSD
2010
ACM
15 years 11 months ago
Composing aspects with aspects
Aspect-oriented programming languages modularize crosscutting concerns by separating the concerns from a base program in aspects. What they do not modularize well is the code need...
Antoine Marot, Roel Wuyts
ICCS
2001
Springer
15 years 10 months ago
Learning to Generate CGs from Domain Specific Sentences
Automatically generating Conceptual Graphs (CGs) [1] from natural language sentences is a difficult task in using CG as a semantic (knowledge) representation language for natural l...
Lei Zhang, Yong Yu
SIGSOFT
2000
ACM
15 years 10 months ago
Compiler and tool support for debugging object protocols
We describe an extension to the Java programming language that supports static conformance checking and dynamic debugging of object "protocols," i.e., sequencing constra...
Sergey Butkevich, Marco Renedo, Gerald Baumgartner...