Sciweavers

476 search results - page 66 / 96
» The Complexity of Equality Constraint Languages
Sort
View
DAGSTUHL
1996
13 years 11 months ago
Specialization of Imperative Programs Through Analysis of Relational Expressions
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
Alexander Sakharov
DLOG
2009
13 years 7 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph
COGSCI
2011
85views more  COGSCI 2011»
13 years 5 months ago
Adaptation to Novel Accents: Feature-Based Learning of Context-Sensitive Phonological Regularities
This paper examines whether adults can adapt to novel accents of their native language that contain unfamiliar context-dependent phonological alternations. In two experiments, Fre...
Katrin Skoruppa, Sharon Peperkamp
POPL
2001
ACM
14 years 10 months ago
Avoiding exponential explosion: generating compact verification conditions
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
Cormac Flanagan, James B. Saxe
JSS
2010
215views more  JSS 2010»
13 years 8 months ago
Analyzing architectural styles
The backbone of many software architectures and component integration frameworks is an architectural style that provides a domain-specific design vocabulary and a set of constrai...
Jung Soo Kim, David Garlan