Sciweavers

1418 search results - page 135 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
PPDP
2010
Springer
15 years 2 months ago
Tabling for transaction logic
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Paul Fodor, Michael Kifer
PLDI
2012
ACM
13 years 7 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
IWPC
2006
IEEE
15 years 10 months ago
Dynamic Data Structure Analysis for Java Programs
Analysis of dynamic data structure usage is useful for both program understanding and for improving the accuracy of other program analyses. Static analysis techniques, however, su...
Sokhom Pheng, Clark Verbrugge
COMPSAC
1999
IEEE
15 years 8 months ago
Dynamic Software Architecture Slicing
As the complexity of software systems increases, so need for a good mechanism of abstraction. architecture design is an abstraction, hiding an immense amount of details about the ...
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T....
DGO
2007
97views Education» more  DGO 2007»
15 years 6 months ago
Interactive exploration and discovery of e-government services
Government e-services available to citizens represent one of the most frequent and critical points of contact between public administrations and citizens. In addition to common se...
Giovanni Maria Sacco