Sciweavers

1418 search results - page 102 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
15 years 10 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
SEMWEB
2004
Springer
15 years 9 months ago
Working with Multiple Ontologies on the Semantic Web
The standardization of the second generation Web Ontology Language, OWL, leaves a crucial issue for Web-based ontologies unsatisfactorily resolved: how to represent and reason with...
Bernardo Cuenca Grau, Bijan Parsia, Evren Sirin
AGTIVE
2003
Springer
15 years 9 months ago
Meta-Modelling, Graph Transformation and Model Checking for the Analysis of Hybrid Systems
Abstract. This paper presents the role of meta-modelling and graph transformation in our approach for the modelling, analysis and simulation of complex systems. These are made of c...
Juan de Lara, Esther Guerra, Hans Vangheluwe
ICFP
2005
ACM
16 years 4 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
IPPS
2003
IEEE
15 years 9 months ago
Loop Dissevering: A Technique for Temporally Partitioning Loops in Dynamically Reconfigurable Computing Platforms
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...
João M. P. Cardoso