Sciweavers

597 search results - page 59 / 120
» Formal Techniques for Java-Like Programs
Sort
View
ICFP
2005
ACM
14 years 7 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
TOOLS
2009
IEEE
14 years 2 months ago
On Realizing a Framework for Self-tuning Mappings
Realizing information exchange is a frequently recurring challenge in nearly every domain of computer science. Although languages, formalisms, and storage formats may differ in va...
Manuel Wimmer, Martina Seidl, Petra Brosch, Horst ...
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
13 years 11 months ago
Computer-Aided Computing
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
Natarajan Shankar
SLP
1989
87views more  SLP 1989»
13 years 8 months ago
Partial Evaluation in Prolog: Some Improvements about Cut
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The analysis about cut is exhaustive: we consider occurrence...
Michele Bugliesi, F. Russo
IEE
2008
115views more  IEE 2008»
13 years 7 months ago
Faithful mapping of model classes to mathematical structures
ion techniques are indispensable for the specification and verification of functional behavior of programs. In object-oriented ation languages like JML, a powerful abstraction tec...
Ádám Darvas, Peter Müller