Search for dissertations about: "Declarative Programming"
Showing result 6 - 10 of 31 swedish dissertations containing the words Declarative Programming.
-
6. Testing for ASP—ASP for Testing
Abstract : Answer-set programming (ASP) is a prominent approach for declarative problem solving with roots in non-monotonic reasoning, knowledge representation, and logic programming. As a problem solving paradigm, it means that properties of problem solutions are modelled using declarative rules so that an ASP solver can then be used to search for solutions which are referred to as answer sets. READ MORE
-
7. Flow Java : declarative concurrency for Java
Abstract : This thesis presents the design, implementation, and evaluation of Flow Java, a programming language for the implementation of concurrent programs. Flow Java adds powerful programming abstractions for automatic synchronization of concurrent programs to Java. READ MORE
-
8. Declarative Specification of Intraprocedural Control-flow and Dataflow Analysis
Abstract : Static program analysis plays a crucial role in ensuring the quality and security of software applications by detecting and fixing bugs, and potential security vulnerabilities in the code. The use of declarative paradigms in dataflow analysis as part of static program analysis has become increasingly popular in recent years. READ MORE
-
9. Debugging and Structural Analysis of Declarative Equation-Based Languages
Abstract : A significant part of the software development effort is spent on detecting deviations between software implementations and specifications, and subsequently locating the sources of such errors. This thesis illustrates that is possible to identify a significant number of errors during static analysis of declarative object-oriented equation-based modeling languages that are typically used for system modeling and simulation. READ MORE
-
10. Logic programming with external procedures : an implementation
Abstract : This work aims at combining logic programs with functions written in other languages, such that the combination preserves the declarative semantics of the logic program. S-Unification, as defined by S. Bonnier and J. Maluszynski, provides a theoretical foundation for this. READ MORE