Sciweavers

319 search results - page 14 / 64
» Foundational Aspects of Syntax
Sort
View
ICFP
2003
ACM
14 years 7 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish
SEMWEB
2004
Springer
14 years 26 days ago
Semantic Web Publishing using Named Graphs
The Semantic Web consists of many RDF graphs nameable by URIs. This paper extends the syntax and semantics of RDF to cover such Named Graphs. This enables RDF statements that descr...
Jeremy J. Carroll, Christian Bizer, Patrick J. Hay...
ACSAC
2000
IEEE
13 years 12 months ago
Extending Java for Package based Access Control
This paper describes an extension of the Java language that provides “programmable security.” The approach augments the Java syntax with constructs for specifying various acce...
John Hale, Mauricio Papa, Oliver Bremer, Rodrigo C...
DEXAW
1997
IEEE
99views Database» more  DEXAW 1997»
13 years 11 months ago
A Framework for Dynamic Changes in Workflow Management Systems
Current workflow management systems (WFMSs) are only applicable in a reliable and secure manner, if the business process (BP) to be supported is wellstructured. As ad hoc deviatio...
Manfred Reichert, Peter Dadam
BIRTHDAY
2010
Springer
13 years 8 months ago
Thirteen Definitions of a Stable Model
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
Vladimir Lifschitz