Sciweavers

383 search results - page 12 / 77
» Formal Syntax and Semantics of Case Stacking Languages
Sort
View
ICFP
2005
ACM
14 years 8 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
SAC
2000
ACM
14 years 2 days ago
An Approach for Modeling the Name Lookup Problem in the C++ Programming Language
Abstract. Formal grammars are well established for specifying the syntax of programming languages. However, the formal specification of programming language semantics has proven mo...
James F. Power, Brian A. Malloy
SEMWEB
2007
Springer
14 years 2 months ago
OBO and OWL: Leveraging Semantic Web Technologies for the Life Sciences
OBO is an ontology language that has often been used for modeling ontologies in the life sciences. Its definition is relatively informal, so, in this paper, we provide a clear spe...
Christine Golbreich, Matthew Horridge, Ian Horrock...
ICECCS
2008
IEEE
203views Hardware» more  ICECCS 2008»
14 years 2 months ago
Using AADL to Model a Protocol Stack
In recent trends, the Architecture Analysis and Design Language (AADL) has received increasing attention from safety-critical software development industries. Specific about the A...
Didier Delanote, Stefan Van Baelen, Wouter Joosen,...
ISSTA
2009
ACM
14 years 3 months ago
A formal analysis of requirements-based testing
The aim of requirements-based testing is to generate test cases from a set of requirements for a given system or piece of software. In this paper we propose a formal semantics for...
Charles Pecheur, Franco Raimondi, Guillaume Brat