Sciweavers

756 search results - page 25 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
SEFM
2005
IEEE
15 years 3 months ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier
101
Voted
ICCAD
2007
IEEE
165views Hardware» more  ICCAD 2007»
15 years 1 months ago
Automated refinement checking of concurrent systems
Stepwise refinement is at the core of many approaches to synthesis and optimization of hardware and software systems. For instance, it can be used to build a synthesis approach for...
Sudipta Kundu, Sorin Lerner, Rajesh Gupta
SIGCSE
2000
ACM
453views Education» more  SIGCSE 2000»
15 years 2 months ago
Aristotle and object-oriented programming: why modern students need traditional logic
Classifying is a central activity in object-oriented programming and distinguishes it from procedural programming. Traditional logic, initiated by Aristotle, assigns classificatio...
Derek Rayside, Gerard T. Campbell
ICANN
2009
Springer
15 years 4 months ago
Logics and Networks for Human Reasoning
We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued Lukasiewicz semantics. Given an appropriate immediate consequence operat...
Steffen Hölldobler, Carroline Dewi Puspa Kenc...
ENTCS
2008
109views more  ENTCS 2008»
14 years 9 months ago
Separation Logic for Multiple Inheritance
As an extension to Floyd-Hoare logic, separation logic has been used to facilitate reasoning about imperative programs manipulating shared mutable data structures. Recently, it ha...
Chenguang Luo, Shengchao Qin