3572 search results - page 422 / 715 » Nominal Logic Programming |
141
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
153
click to vote
PEPM
2009
ACM
15 years 9 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...
150
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
The Semantic Web languages RDFS and OWL have been around for some time now. However, the presence of these languages has not brought the breakthrough of the Semantic Web the creat...
139
click to vote
FOSSACS
2009
Springer
15 years 12 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
160
click to vote
PADL
2004
Springer
15 years 10 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...