ΦLOG: a domain specific language for solving phylogenetic inference problems

Pontelli, Enrico; Ranjan, Desh; Milligan, Brook G.; Gupta, Gopal

doi:10.1109/csb.2002.1039324

Cited by 2 publications

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These include generating code for parallelizing compilers [9] and for controllers specified in Ada (for verification purposes) in a provably correct manner, and rapidly implementing a domain specific language for bioinformatics [24] and most recently generating code in a provably correct manner for the Software Cost Reduction (SCR) framework, discussed next.…”

Section: Applicationsmentioning

confidence: 99%

Rapidly prototyping implementation infrastructure of domain specific languages

Wang¹,

Gupta²

2005

Proceedings of the 2005 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. However, designing of a domain specific language is a difficult task. The design of a domain specific language will evolve as it is used more and more and experienced is gained by its designers. Being able to rapidly develop the implementation infrastructure (interpreter, compiler, debugger, profiler, etc.) of a domain specific language is thus of utmost importance so that as the language evolves, the implementation infrastructure can keep pace. In this paper we present a framework for automatically generating interpreters, compilers, debuggers, and profilers from semantic specification of a domain specific language. We illustrate our approach via the SCR language, a language used by the US defense department for developing control systems.

show abstract

Section: Applicationsmentioning

confidence: 99%

Rapidly prototyping implementation infrastructure of domain specific languages

Wang¹,

Gupta²

2005

Proceedings of the 2005 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…The preliminary experiments performed have provided encouraging results, and work is in progress to establish the full range of capabilities of this approach. In particular, we intend to use the proposed framework in the design of bioinformatics applications-i.e., software agents in charge of mapping high-level biological process descriptions into a predefined collection of software services [27]-and in the development of Web accessibility agents for visually impaired individuals [28]. Several other approaches to dealing with preferences between logic programming rules have been proposed [3,5,37].…”

Section: Example 10 Consider a Mail Delivering Robot Who Drives Arounmentioning

confidence: 99%

Reasoning about Actions and Planning with Preferences Using Prioritized Default Theory

Son

Pontelli

2004

Computational Intelligence

View full text Add to dashboard Cite

This paper shows how action theories, expressed in an extended version of the language B, can be naturally encoded using Prioritized Default Theory. We also show how prioritized default theory can be extended to express preferences between rules. This extension provides a natural framework to introduce different types of preferences in action theories-preferences between actions and preferences between final states. In particular, we demonstrate how these preferences can be expressed within extended prioritized default theory. We also discuss how this framework can be implemented in terms of answer set programming.

show abstract

ΦLOG: a domain specific language for solving phylogenetic inference problems

Cited by 2 publications

References 22 publications

Rapidly prototyping implementation infrastructure of domain specific languages

Rapidly prototyping implementation infrastructure of domain specific languages

Reasoning about Actions and Planning with Preferences Using Prioritized Default Theory

Contact Info

Product

Resources

About