267,888 Hits in 4.1 sec

A domain-specific language for cryptographic protocols based on streams

Jan Jürjens
2009 The Journal of Logic and Algebraic Programming  
We present an approach that aims to address this need by making use of a domain-specific language for crypto protocol implementations.  ...  One can then use it to provide assurance for legacy implementations of crypto protocols by generating test-cases.  ...  Constructive comments from the anonymous reviewers which helped clarifying several points in the paper are very gratefully acknowledged.  ... 
doi:10.1016/j.jlap.2008.08.006 fatcat:qisg6hnfzfcepfxowv6bqenwia

Specifying algebraic data types by domain equations [chapter]

H. -D. Ehrich
1981 Lecture Notes in Computer Science  
The paper nrovides the theoretical foundation for a new algebraic specification method, using parameterized specifications and algebraic domain equations, an algebraic analogon to the domain equations  ...  The main result is that algebraic domain equations always have an initial solution. Also, a parametric version of algebraic domain equations is investigated.  ...  The specification of this algebra is D P_P, the pushout object of p and f.  ... 
doi:10.1007/3-540-10854-8_12 fatcat:qdhjk5zphrakxbgdjuzyhiimue

Algebraic Specification of Web Services

Hong Zhu, Bo Yu
2010 2010 10th International Conference on Quality Software  
This paper presents an algebraic specification language for the formal specification of the semantics of web services. A set of rules for transforming WSDL into algebraic structures is proposed.  ...  Recently, specifications based on co-algebras allows the co-domains of operators to be non-singleton. It can be any sequence of sorts. However, the domain must be a singleton.  ...  One of its most attractive features of algebraic specification is that it supports automatic testing of software systems.  ... 
doi:10.1109/qsic.2010.47 dblp:conf/qsic/ZhuY10a fatcat:g35ru7awfbftbgjvl6wo2fzheu

Using Domain Specific Languages to Support Verification in the Railway Domain [chapter]

Phillip James, Arnold Beckmann, Markus Roggenbach
2013 Lecture Notes in Computer Science  
We explore the support of automatic verification via careful design of a domain specific language (DSL) in the context of algebraic specification.  ...  We illustrate these ideas within the Railway Domain using the algebraic specification language Casl and an existing DSL, designed by Bjørner, for modelling railways.  ...  Here we demonstrate, for algebraic specification, an approach where DSLs within the railway domain aid verification.  ... 
doi:10.1007/978-3-642-39611-3_26 fatcat:lltzxwkpbfchjeexj5qptwebgu

From Algebraic Specification to Ontological Description of Service Semantics

Dongmei Liu, Hong Zhu, Ian Bayley
2013 2013 IEEE 20th International Conference on Web Services  
The algebraic specification language we use is SOFIA (Service Oriented Formalism in Algebras).  ...  Our technique is to specify services formally in an algebraic specification language and then to extract ontological description as profiles in the language OWL-S, with the associated searchability benefits  ...  ACKNOWLEDGEMENT The work reported in this paper is partially supported by EU FP7 project MONICA on Mobile Cloud Computing  ... 
doi:10.1109/icws.2013.93 dblp:conf/icws/LiuZB13 fatcat:ed4vlkgyoncjrde4lrf7j7kp2a

An Algebra For Protein Structure Data

Yanchao Wang, Rajshekhar Sunderraman
2009 Zenodo  
This paper presents an algebraic approach to optimize queries in domain-specific database management system for protein structure data.  ...  The approach involves the introduction of several protein structure specific algebraic operators to query the complex data stored in an object-oriented database system.  ...  CURRENT ARCHITECTURE OF PROTEIN DOMAIN SPECIFIC OBJECT-ORIENTED DATABASE MANAGEMENT SYSTEM The overall architecture of protein domain specific objectoriented database management system for protein structure  ... 
doi:10.5281/zenodo.1061435 fatcat:pr7ucmk3ifgxrgyjzxxw2gnery

The completeness of the algebraic specification methods for computable data types

J.A. Bergstra, J.V. Tucker
1982 Information and Control  
The following fundamental theorem about the adequacy of the algebraic specification methods for data abstractions is proved. Let A be a data type with n subtypes.  ...  Then A is computable if, and only if, A possesses an equational specification, involving at most 3(n + 1) hidden operators and 2(n + 1) axioms, which defines it under initial and final algebra semantics  ...  The point of this paper is to settle one basic question about the completeness or adequacy of the two specification methods: Can algebraic specifications under initial and/or final algebra semantics define  ... 
doi:10.1016/s0019-9958(82)80021-1 fatcat:ha4hi6ghnrcqhbo45k2k4tkuzq

Algebraic domain equations

Hans-Dieter Ehrich, Udo Lipeck
1983 Theoretical Computer Science  
Examples illustrate the usefulness of implicit specifications in certain cases. Then, a parametric version of algebraic domain equations is introduced having parameterized data types as solutions.  ...  The main result is that strongly persistent algebraic domain equations always have an initial solution. and there is a simple syntactic method to construct a specification of this initial solution.  ...  Manes' criticism on an earlier draft of this paper. Of course, we take full responsibility fc+r all remaining deficiencies.  ... 
doi:10.1016/0304-3975(83)90098-1 fatcat:y7bpq5pql5hv3jrdfraiwjxy5y

How to Enable Policy-Based Interactions in Dynamic Wireless Networks?

Chi-Kin Chau, Jon Crowcroft, Kang-Won Lee, Starsky H.Y. Wong
2008 2008 IEEE Workshop on Policies for Distributed Systems and Networks  
Policy is a key component in the interoperations among multiple heterogeneous domains of networks with different routing metrics and preferences.  ...  considering MANET-specific characteristics.  ...  Next-hop Specification: A simple approach to specify inter-domain routing policies is based on the next-hop domains in the routes to a specific destination, and ignored the rest of downstream domains.  ... 
doi:10.1109/policy.2008.11 dblp:conf/policy/ChauCLW08 fatcat:l3riqcdgufh5tpqp6qjpggyr5m

Comparison of Functional and Predicative Query Paradigms

Catriel Beeri, Tova Milo
1997 Journal of computer and system sciences (Print)  
The framework is based on a combination the well-founded approach of deductive programs and the initial algebra approach of algebraic specifications.  ...  We extend the notions of domain independence to our framework. We then present various sufficient conditions for the calculus and (some) algebra to be equivalent.  ...  consist of the initial algebra of the types specification and, on top, the wellfounded model of the predicates [5] .  ... 
doi:10.1006/jcss.1997.1449 fatcat:sfevhz3arrhv3iftchqjalzw5q


Dongmei Liu, Hong Zhu, Ian Bayley
2014 Services Transactions on Services Computing  
It specifies services formally in an algebraic specification language, and then, extracts an ontological description of domain knowledge and service semantics as profiles in an ontology description language  ...  In contrast, formal specification techniques, having evolved over the past 30 years, can define semantics in such a manner, but they have not yet been widely applied to service computing because the specifications  ...  ACKNOWLEDGMENT The work reported in this paper is partially supported by EU FP7 project MONICA on Mobile Cloud Computing  ... 
doi:10.29268/stsc.2014.2.1.5 fatcat:qnouiv2y55et7liabunbwfje3e

The Road to Utopia: A Future for Generative Programming [chapter]

Don Batory
2004 Lecture Notes in Computer Science  
The future of software engineering lies in automation and will exploit the combined strengths of generative programming, domain-specific languages, and automatic programming.  ...  I argue that the road that they have so successfully followed is the same road that the generative programming, domain-specific languages, and automatic programming communities are now traversing.  ...  One reason for this is that domain-specific optimizations are below the level of relational algebraic rewrites; one has to break encapsulation of abstractions to achieve better performance.  ... 
doi:10.1007/978-3-540-25935-0_1 fatcat:asjkccd6pbcjji3ocu2it5r2zq

Case Study on Algebraic Software Methodologies for Scientific Computing

Magne Haveraaen
2000 Scientific Programming  
The use of domain specific languages and appropriate software architectures are currently seen as the way to enhance reusability and improve software productivity.  ...  Optimization, looking at high-level transformations enabled by the domain specific programming style.  ...  Acknowledgements Thanks to Hans Munthe-Kaas for initiating this area of research with me and providing many useful discus-  ... 
doi:10.1155/2000/482042 fatcat:r52dgn7m3jgyleul4x7mfzwv5i

Modules for a model-oriented specification language: A proposal for metasoft [chapter]

Andrzej Tarlecki
1992 Lecture Notes in Computer Science  
Since an algebra is just an environment of named sets (carriers of the algebra) and functions on these sets (operations of the Mgebra) this is sufficient to define algebras, and hence model-oriented specifications  ...  In our view, much work on structuring specifications done in the area of algebraic specification addressed the fundamental issues of manipulating specifications, rather than more down-to-earth, specific  ...  Much of the work presented follows what I have learnt in a continuing close collaboration with Don Sannella on many issues of software specification and development.  ... 
doi:10.1007/3-540-55253-7_27 fatcat:ugzajbtxuvh4nhgxua72vqsenm

Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL [chapter]

Simon Foster, Georg Struth, Tjark Weber
2011 Lecture Notes in Computer Science  
We present a new integration of relational and algebraic methods in the Isabelle/HOL theorem proving environment.  ...  It consists of a fine grained hierarchy of algebraic structures based on Isabelle's type classes and locales, and a repository of more than 800 facts obtained by automated theorem proving.  ...  Acknowledgments The authors would like to thank Andy Gordon, Tony Hoare, Peter Jipsen and Makarius Wenzel for fruitful discussions.  ... 
doi:10.1007/978-3-642-21070-9_5 fatcat:oszkpd2pfrbsnovtsp7mvn3sha
« Previous Showing results 1 — 15 out of 267,888 results