Sciweavers

272 search results - page 26 / 55
» Programming languages capturing complexity classes
Sort
View
109
Voted
ICFP
2007
ACM
16 years 20 days ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
132
Voted
UML
2005
Springer
15 years 6 months ago
Visualization in the Context of Model Driven Engineering
Understanding and maintenance of complex information spaces is often supported through visual interfaces. These interfaces must be highly flexible in order to adapt to both the u...
R. Ian Bull, Jean-Marie Favre

Book
411views
16 years 10 months ago
Concrete Abstractions
"This book has evolved from materials used in an undergraduate course intended for final year undergraduate students whose background includes at least one year's experie...
Max Hailperin, Barbara Kaiser, and Karl Knight
106
Voted
ICSE
2003
IEEE-ACM
15 years 6 months ago
A Tutorial on Feature Oriented Programming and Product-Lines
ct Feature Oriented Programming (FOP) is a design methodology and tools for program synthesis. The goal is to specify a target program in terms of the features that it offers, and ...
Don S. Batory
115
Voted
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
15 years 6 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...