1410 search results - page 253 / 282 » Proving theorems by reuse |
IWPC
2003
IEEE
14 years 3 months ago
2003
IEEE
Parsing programming languages is an essential component of the front end of most program comprehension tools. Languages such as C++ can be difficult to parse and so it can prove ...
CSL
2003
Springer
14 years 3 months ago
2003
Springer
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...
EPIA
2003
Springer
14 years 3 months ago
2003
Springer
We describe how to build a network intrusion detection sensor by slightly modifying NASA’s CLIPS source code introducing some new features. An overview of the system is presente...
IEEEPACT
2002
IEEE
14 years 2 months ago
2002
IEEE
Memory performance is increasingly determining microprocessor performance and technology trends are exacerbating this problem. Most architectures use set-associative caches with L...
IPPS
2002
IEEE
14 years 2 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...