Sciweavers

7456 search results - page 1314 / 1492
» Parallelism in Logic Programming
Sort
View
112
Voted
SIGSOFT
2006
ACM
16 years 4 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
120
Voted
WWW
2007
ACM
16 years 4 months ago
From SPARQL to rules (and back)
As the data and ontology layers of the Semantic Web stack have achieved a certain level of maturity in standard recommendations such as RDF and OWL, the current focus lies on two ...
Axel Polleres
WWW
2004
ACM
16 years 4 months ago
Web customization using behavior-based remote executing agents
ReAgents are remotely executing agents that customize Web browsing for non-standard resource-limited clients. A reAgent is essentially a "one-shot" mobile agent that act...
Eugene Hung, Joseph Pasquale
CADE
2009
Springer
16 years 4 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
109
Voted
CADE
2008
Springer
16 years 3 months ago
Proving Group Protocols Secure Against Eavesdroppers
Security protocols are small programs designed to ensure properties such as secrecy of messages or authentication of parties in a hostile environment. In this paper we investigate ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
« Prev « First page 1314 / 1492 Last » Next »