Zobrazeno 1 - 10
of 97
pro vyhledávání: '"Mosses, P.D."'
Publikováno v:
Eelco Visser Commemorative Symposium, EVCS 2023
Spoofax is a language workbench. A Spoofax language specification generally includes name resolution: the analysis of bindings between definitions and references. When browsing code in the specified language using Spoofax, the bindings appear as hype
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 310, Iss Proc. F-IDE 2019, Pp 29-34 (2019)
F-IDE@FM
Proceedings Fifth Workshop on Formal Integrated Development Environment, F-IDE@FM 2019, Porto, Portugal, 7th October 2019, 310
F-IDE@FM
Proceedings Fifth Workshop on Formal Integrated Development Environment, F-IDE@FM 2019, Porto, Portugal, 7th October 2019, 310
The CBS framework supports component-based specification of programming languages. It aims to significantly reduce the effort of formal language specification, and thereby encourage language developers to exploit formal semantics more widely. CBS pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bac00958385fe4785e32ecc126f9137
Publikováno v:
CONCUR 2013 – Concurrency Theory ISBN: 9783642401831
CONCUR
CONCUR 2013-Concurrency Theory (24th International Conference on Concurrency Theory, Buenos Aires, Argentina, August 27-30, 2013. Proceedings), 46-60
STARTPAGE=46;ENDPAGE=60;TITLE=CONCUR 2013-Concurrency Theory (24th International Conference on Concurrency Theory, Buenos Aires, Argentina, August 27-30, 2013. Proceedings)
CONCUR
CONCUR 2013-Concurrency Theory (24th International Conference on Concurrency Theory, Buenos Aires, Argentina, August 27-30, 2013. Proceedings), 46-60
STARTPAGE=46;ENDPAGE=60;TITLE=CONCUR 2013-Concurrency Theory (24th International Conference on Concurrency Theory, Buenos Aires, Argentina, August 27-30, 2013. Proceedings)
Transition rules with negative premises are needed in the structural operational semantics of programming and specification constructs such as priority and interrupt, as well as in timed extensions of specification languages. The well-known proof-the
Publikováno v:
Proceedings of the 2nd Workshop on Structural Operational Semantics (SOS2005, Lisbon, Portugal, July 10, 2005; satellite to ICALP2005), 3-25
STARTPAGE=3;ENDPAGE=25;TITLE=Proceedings of the 2nd Workshop on Structural Operational Semantics (SOS2005, Lisbon, Portugal, July 10, 2005; satellite to ICALP2005)
STARTPAGE=3;ENDPAGE=25;TITLE=Proceedings of the 2nd Workshop on Structural Operational Semantics (SOS2005, Lisbon, Portugal, July 10, 2005; satellite to ICALP2005)
In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin. A structural approach to operational semantics. Technical R
Publikováno v:
Recent Trends in Algebraic Development Techniques ISBN: 9783540678984
WADT
Recent Trends in Algebraic Development Techniques (Selected Papers, 14th International Workshop, WADT '99, Château de Bonas, France, September 15-18, 1999), 89-105
STARTPAGE=89;ENDPAGE=105;TITLE=Recent Trends in Algebraic Development Techniques (Selected Papers, 14th International Workshop, WADT '99, Château de Bonas, France, September 15-18, 1999)
WADT
Recent Trends in Algebraic Development Techniques (Selected Papers, 14th International Workshop, WADT '99, Château de Bonas, France, September 15-18, 1999), 89-105
STARTPAGE=89;ENDPAGE=105;TITLE=Recent Trends in Algebraic Development Techniques (Selected Papers, 14th International Workshop, WADT '99, Château de Bonas, France, September 15-18, 1999)
An environment for the Common Algebraic Specification Language CASL consists of several independent tools. A number of CASL tools have been built using the algebraic specification formalism ASF+SDF and the ASF+SDF Meta-Environment. CASL supports user
Autor:
Krieg-Brückner, B., Mosses, P.D.
Publikováno v:
Krieg-Brückner, B, Mosses, P D & Mosses, P D (ed.) 2004, Casl Summary . in Casl Reference Manual, The Complete Documentation of the Common Algebraic Specification Language . 2960 i Lecture Notes in Computer Science edn, Springer, pp. 1-69 .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::b64c60341a220113d9c4874bb0b8041f
https://pure.au.dk/portal/da/publications/casl-summary(e52c91c0-83a8-11dc-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/casl-summary(e52c91c0-83a8-11dc-bee9-02004c4f4f50).html
Sound behavioral equations on open terms may become unsound after conservative extensions of the underlying operational semantics. Providing criteria under which such equations are preserved is extremely useful; in particular, it can avoid the need t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::92de8ca7469725fa2f550f28185157aa
https://research.tue.nl/nl/publications/89d500fd-109d-466f-abf2-98c73ae81e84
https://research.tue.nl/nl/publications/89d500fd-109d-466f-abf2-98c73ae81e84
Publikováno v:
Expressiveness in Concurrency (17th International Workshop, EXPRESS'10, Paris, France, August 30th, 2010), 106-120
STARTPAGE=106;ENDPAGE=120;TITLE=Expressiveness in Concurrency (17th International Workshop, EXPRESS'10, Paris, France, August 30th, 2010)
EXPRESS
Electronic Proceedings in Theoretical Computer Science, Vol 41, Iss Proc. EXPRESS 2010, Pp 106-120 (2010)
STARTPAGE=106;ENDPAGE=120;TITLE=Expressiveness in Concurrency (17th International Workshop, EXPRESS'10, Paris, France, August 30th, 2010)
EXPRESS
Electronic Proceedings in Theoretical Computer Science, Vol 41, Iss Proc. EXPRESS 2010, Pp 106-120 (2010)
Sound behavioral equations on open terms may become unsound after conservative extensions of the underlying operational semantics. Providing criteria under which such equations are preserved is extremely useful; in particular, it can avoid the need t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4d189edfd51fef559a326635665276b
https://research.tue.nl/nl/publications/7c309b13-5e31-4fcd-a220-739ad7389a4d
https://research.tue.nl/nl/publications/7c309b13-5e31-4fcd-a220-739ad7389a4d
Publikováno v:
Proceedings of the 2nd Workshop on Structural Operational Semantics (SOS2005, Lisbon, Portugal, July 10, 2005; satellite to ICALP2005), 135-150
STARTPAGE=135;ENDPAGE=150;TITLE=Proceedings of the 2nd Workshop on Structural Operational Semantics (SOS2005, Lisbon, Portugal, July 10, 2005; satellite to ICALP2005)
STARTPAGE=135;ENDPAGE=150;TITLE=Proceedings of the 2nd Workshop on Structural Operational Semantics (SOS2005, Lisbon, Portugal, July 10, 2005; satellite to ICALP2005)
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formulae, deduction rules and transition system specifications) in Maude. Bes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8894907b433a0b900ae19b16085afe6
https://doi.org/10.1016/j.entcs.2005.09.030
https://doi.org/10.1016/j.entcs.2005.09.030
Autor:
Mosses, P.D.
Publikováno v:
Mosses, P D, Karsai, G (ed.) & Visser, E (ed.) 2004, Modular Language Descriptions . in Ikke angivet . 3286 i Lecture Notes in Computer Science edn, Springer, pp. 489-490, Vancouver, Canada, 24/10/2004 .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::67951b4c4cf37eefc2940199915db334
https://pure.au.dk/portal/da/publications/modular-language-descriptions(fe1428d0-91e3-11dc-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/modular-language-descriptions(fe1428d0-91e3-11dc-bee9-02004c4f4f50).html