Filters








70,466 Hits in 6.8 sec

Detecting Specification Errors in Declarative Languages with Constraints [chapter]

Ethan K. Jackson, Wolfram Schulte, Nikolaj Bjørner
2012 Lecture Notes in Computer Science  
Declarative specification languages with constraints are used in model-driven engineering to specify formal semantics, define model transformations, and describe domain constraints.  ...  In this paper we present a type-theoretic approach to the static detection of specification errors.  ...  Our earlier example of transforming between between expression languages is an exemplar. Conclusions We presented an approach to static error detection in declarative languages with constraints.  ... 
doi:10.1007/978-3-642-33666-9_26 fatcat:wllx2cpnbndnlfoscbeuboypii

Ontology-Based Model Driven Engineering for Safety Verification

Konstantinos Mokos, George Meditskos, Panagiotis Katsaros, Nick Bassiliades, Vangelis Vasiliades
2010 2010 36th EUROMICRO Conference on Software Engineering and Advanced Applications  
in the AltaRica formal language.  ...  These constraints are semantically represented by mapping them onto an OWL domain ontology, allowing the incorporation of a Description Logic OWL reasoner and inference rules, in order to detect lacks  ...  Specifically, SPARQL rules search all transitions in Error Annex declaration and throw an exception, if there are two transitions with the same initial state, different trigger event and different final  ... 
doi:10.1109/seaa.2010.60 dblp:conf/euromicro/MokosMKBV10 fatcat:ld7itb36eje3tg4u3yo2vqvnom

Automatic fault location for data structures

Vineet Singh, Rajiv Gupta, Iulian Neamtiu
2016 Proceedings of the 25th International Conference on Compiler Construction - CC 2016  
In this work we combine specification-based data structure verification with automatic detection of faulty program statements that corrupt data structures.  ...  Our approach offers two main advantages: (1) a highly precise automatic fault location method, and (2) a simple specification language.  ...  Writing constraints in programming languages is verbose and error prone.  ... 
doi:10.1145/2892208.2892215 dblp:conf/cc/SinghGN16 fatcat:ttdbthizrnbsnnsnd7ps5xxgsu

CoffeeStrainer - Statically Checking Structural Constraints on Java Programs [chapter]

Boris Bokowski
1998 Lecture Notes in Computer Science  
It is generally desirable to detect program errors as early as possible during software development. Statically typed languages allow many errors to be detected at compile-time.  ...  In this paper, we describe a meta-programming framework for Java which allows for static checking of structural constraints.  ...  Introduction It is generally desirable to detect program errors as early as possible during software development. Statically typed languages allow many errors to be detected at compile-time.  ... 
doi:10.1007/3-540-49255-0_111 fatcat:anwayy5bo5cgpbkbdhhyrkcldi

Automatic detection and repair of errors in data structures

Brian Demsky, Martin Rinard
2003 Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications - OOPSLA '03  
We present a system that accepts a specification of key data structure constraints, then dynamically detects and repairs violations of these constraints.  ...  Furthermore, for our set of benchmark applications, our system can effectively repair errors to deliver consistent data structures that allow the program to continue to operate successfully within its  ...  Error Detection in Internal Phase The algorithm detects violations of the internal constraints by evaluating the constraints in the context of the model.  ... 
doi:10.1145/949305.949314 dblp:conf/oopsla/DemskyR03 fatcat:jiqr7qr4sbee3ixcxghj5oslfq

Automatic detection and repair of errors in data structures

Brian Demsky, Martin Rinard
2003 Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications - OOPSLA '03  
We present a system that accepts a specification of key data structure constraints, then dynamically detects and repairs violations of these constraints.  ...  Furthermore, for our set of benchmark applications, our system can effectively repair errors to deliver consistent data structures that allow the program to continue to operate successfully within its  ...  Error Detection in Internal Phase The algorithm detects violations of the internal constraints by evaluating the constraints in the context of the model.  ... 
doi:10.1145/949313.949314 fatcat:dtqicgrfo5fkpckiyrryjshufm

Automatic detection and repair of errors in data structures

Brian Demsky, Martin Rinard
2003 SIGPLAN notices  
We present a system that accepts a specification of key data structure constraints, then dynamically detects and repairs violations of these constraints.  ...  Furthermore, for our set of benchmark applications, our system can effectively repair errors to deliver consistent data structures that allow the program to continue to operate successfully within its  ...  Error Detection in Internal Phase The algorithm detects violations of the internal constraints by evaluating the constraints in the context of the model.  ... 
doi:10.1145/949343.949314 fatcat:s7k62znl2rbvxgacgj4wtlu5lq

DECLARE: Full Support for Loosely-Structured Processes

Maja Pesic, Helen Schonenberg, Wil M.P. van der Aalst
2007 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007)  
DECLARE is a prototype of a WFMS that uses a constraint-based process modeling language for the development of declarative models describing loosely-structured processes.  ...  In this paper we show how DECLARE can support loosely-structured processes without sacrificing important WFMSs features like user support, model verification, analysis of past executions, changing models  ...  DECLARE will detect this error during verification as shown in Figure 12 . On the left part of the screen a list of detected errors is shown.  ... 
doi:10.1109/edoc.2007.14 dblp:conf/edoc/PesicSA07 fatcat:hvoyxmdygvcaff5jgzy3f5edxm

DECLARE: Full Support for Loosely-Structured Processes

Maja Pesic, Helen Schonenberg, Wil M.P. van der Aalst
2007 International Enterprise Distributed Object Computing Conference, Proceedings  
DECLARE is a prototype of a WFMS that uses a constraint-based process modeling language for the development of declarative models describing loosely-structured processes.  ...  In this paper we show how DECLARE can support loosely-structured processes without sacrificing important WFMSs features like user support, model verification, analysis of past executions, changing models  ...  DECLARE will detect this error during verification as shown in Figure 12 . On the left part of the screen a list of detected errors is shown.  ... 
doi:10.1109/edoc.2007.4384001 fatcat:7hllukt5r5avxgviswa3xzbdni

Static consistency checking of web applications with WebDSL

Zef Hemel, Danny M. Groenewegen, Lennart C.L. Kats, Eelco Visser
2011 Journal of symbolic computation  
Inconsistencies in an application are often not detected statically, but appear as errors at run-time.  ...  To remedy these problems, in this paper, we argue that domain-specific languages should be designed from the ground up with static verification and cross-aspect consistency checking in mind, providing  ...  Designing the language with entities as first-class language elements enables reporting of domain-specific error messages.  ... 
doi:10.1016/j.jsc.2010.08.006 fatcat:k2ypap4o7rfndgwd4eiq4m2uje

Declarative Meta Programming to Support Software Development

Tom Mens, Roel Wuyts, Kris De Volder, Kim Mens
2003 Software engineering notes  
This paper reports on the results of the workshop on Declarative Meta Programming to Support Software Development in Edinburgh on September 23, 2002.  ...  With the current state-of-the-art in compiler technology, very efficient logic languages can be implemented. • Declarative meta programming involves a high degree of sophistication.  ...  For example, if we express domain-specific languages with DMP, they can be automatically translated to any target platform. • Declarative programs provide an executable form of documentation.  ... 
doi:10.1145/638750.638770 fatcat:n6ttkcldejaediwf5y6jle3mey

Maintaining XML Data Integrity in Programs [chapter]

Patrick Michel, Arnd Poetzsch-Heffter
2010 Lecture Notes in Computer Science  
XPath) combinations of complex languages hard to know in advance if invariants are violated expensive to check if invariants are violated hard to recover from a detected error verification is next to impossible  ...  7 Abstract Datatype Approach XML datatype with integrity constraints  ...  XPath) combinations of complex languages hard to know in advance if invariants are violated expensive to check if invariants are violated hard to recover from a detected error verification is next to impossible  ... 
doi:10.1007/978-3-642-11266-9_50 fatcat:rm2lnzaefzfpbgxgaumua5d2zm

Polymorphic type checking with subtypes in Prolog [chapter]

Thom W. Frühwirth
1990 Lecture Notes in Computer Science  
Extending Q with static typing improves both the readability of programs and programmer productivity, as type errors are discovered by the tool at compile time, rather than through debugging the program  ...  Q is a terse vector processing language, a descendant of APL, which is getting more and more popular, especially in financial applications. Q is a dynamically typed language, much like Prolog.  ...  Acknowledgements We acknowledge the support of Morgan Stanley Business and Technology Centre, Budapest in the development of the Q type checker system. We are especially grateful to Balázs G.  ... 
doi:10.1007/3-540-52531-9_131 fatcat:quzh2nexxvakdgqos4qa3ofjcq

Using Constraints for Intrusion Detection: The NeMODe System [chapter]

Pedro Salgueiro, Daniel Diaz, Isabel Brito, Salvador Abreu
2011 Lecture Notes in Computer Science  
In this work we present NeMODe a declarative system for Computer Network Intrusion detection which provides a declarative Domain Specific Language for describing computer network intrusion signatures that  ...  could spread across several network packets, which allows to state constraints over network packets, describing relations between several packets, and providing several back-end detection mechanisms which  ...  Acknowledgments Pedro Salgueiro acknowledges FCT -Fundação para a Ciência e a Tecnologia-for supporting him with scholarship SFRH/BD/35581/2007.  ... 
doi:10.1007/978-3-642-18378-2_11 fatcat:2sxx6j65yjdp7gioqt557jjmwq

Disambiguating aspect-oriented security policies

Micah Jones, Kevin W. Hamlen
2010 Proceedings of the Eighth International Conference on Aspect-Oriented Software Development - AOSD '10  
The algorithm reduces advice conflict detection to a combination of boolean satisfiability, linear programming, and regular language non-emptiness.  ...  Bugs in these aspectually-implemented security policies often manifest as ambiguities in which aspects provide conflicting advice for a shared join point.  ...  We have further observed that in such a policy language, many common specification errors manifest as policy nondeterminism.  ... 
doi:10.1145/1739230.1739253 dblp:conf/aosd/JonesH10 fatcat:f6qzpom35vdynel2szt42yinfa
« Previous Showing results 1 — 15 out of 70,466 results