Result 1 to 20 of 446 total
Semantics of non-deterministic possibility computation. (English)
Fuzzy Sets Syst. 199, 47-63 (2012).
1
ECMA-335 static formal semantics. (English)
Program. Comput. Softw. 38, No. 4, 183-188 (2012); translation from Programmirovanie 38, No. 4 (2012).
2
An institution theory of formal meta-modelling in graphically extended BNF. (English)
Front. Comput. Sci. 6, No. 1, 40-56 (2012).
3
Polarities in logic and semantics. (English)
Aloni, Maria (ed.) et al., Logic, language and meaning. 18th Amsterdam colloquium, Amsterdam, The Netherlands, December 19‒21, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31481-0/pbk). Lecture Notes in Computer Science 7218, 230-239 (2012).
4
On behavioural pseudometrics and closure ordinals. (English)
Inf. Process. Lett. 112, No. 19, 715-718 (2012).
5
Flexible software architecture and language for mobile agents. (English)
Concurrency Comput. Pract. Exp. 24, No. 6, 559-571 (2012).
6
Formalisation and implementation of the XACML access control mechanism. (English)
Barthe, Gilles (ed.) et al., Engineering secure software and systems. 4th international symposium, ESSoS 2012, Eindhoven, The Netherlands, February, 16‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28165-5/pbk). Lecture Notes in Computer Science 7159, 60-74 (2012).
7
An alternate proof of Statman’s finite completeness theorem. (English)
Inf. Process. Lett. 112, No. 14-15, 612-616 (2012).
8
Refinement-oriented models of Stateflow charts. (English)
Sci. Comput. Program. 77, No. 10-11, 1151-1177 (2012).
9
Using formal methods to develop WS-BPEL applications. (English)
Sci. Comput. Program. 77, No. 3, 189-213 (2012).
10
On the formalization of UML activities for component-based protocol design specifications. (English)
Bieliková, Mária (ed.) et al., SOFSEM 2012: Theory and practice of computer science. 38th conference on current trends in theory and practice of computer science, Špindlerův Mlýn, Czech Republic, January 21‒27, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-27659-0/pbk). Lecture Notes in Computer Science 7147, 479-491 (2012).
11
A correspondence between type checking via reduction and type checking via evaluation. (English)
Inf. Process. Lett. 112, No. 1-2, 13-20 (2012).
12
Time-dependent cryptographic protocol logic and its formal semantics. (Chinese)
J. Softw. 22, No. 3, 534-557 (2011).
13
A unifying theory of control dependence and its application to arbitrary program structures. (English)
Theor. Comput. Sci. 412, No. 49, 6809-6842 (2011).
14
On type coercion in compositional and lexical semantics. (English)
Kanazawa, Makoto (ed.) et al., The mathematics of language. 12th biennial conference, MOL 12, Nara, Japan, September 6‒8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23210-7/pbk). Lecture Notes in Computer Science 6878. Lecture Notes in Artificial Intelligence, 108-125 (2011).
15
Algebraic separation logic. (English)
J. Log. Algebr. Program. 80, No. 6, 221-247 (2011).
16
A novel formalization of symbolic trajectory evaluation semantics in Isabelle/HOL. (English)
Theor. Comput. Sci. 412, No. 25, 2746-2765 (2011).
17
Partial order semantics for use case and task models. (English)
Formal Asp. Comput. 23, No. 3, 307-332 (2011).
18
An efficient enumeration algorithm for canonical form underspecified semantic representations. (English)
de Groote, Philippe (ed.) et al., Formal grammar. 14th international conference, FG 2009, Bordeaux, France, July 25‒26, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-20168-4/pbk). Lecture Notes in Computer Science 5591. Lecture Notes in Artificial Intelligence, 85-101 (2011).
19
An introduction to practical formal methods using temporal logic. (English)
Hoboken, NJ: John Wiley \& Sons (ISBN 978-0-470-02788-2/hbk; 978-1-11-999147-2/ebook). vii, 353~p. \sterling~80.00; EUR~96.00 (2011).
20
Result 1 to 20 of 446 total
Start
Contact
Print
General Help
