SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

ACM SIGPLAN Notices

Volumn 47, Issue 1, 2012, Pages 401-412

Towards nominal computation

(4) Bojańczyk, Mikołaj a Braud, Laurent a Klin, Bartek a Lasota, Sławomir a

a UNIVERSITY OF WARSAW (Poland)

Author keywords

calculus; Automata on data words; Nominal sets

Indexed keywords

AUTOMATA ON DATA WORDS; FINITE SET; NOMINAL SETS; PROGRAMMING LANGUAGE;

COMPUTER PROGRAMMING; COMPUTER SCIENCE;

SET THEORY;

EID: 84857154450 PISSN: 15232867 EISSN: None Source Type: Journal
DOI: 10.1145/2103621.2103704 Document Type: Conference Paper

Times cited : (41)

References (18)

1
- 26644455517
- Decidability and complexity results for timed automata via channel machines
- Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005. Proceedings
- P. Aziz Abdulla, J. Deneux, J. Ouaknine, and J. Worrell. Decidability and complexity results for timed automata via channel machines. In ICALP, pages 1089-1101, 2005. (Pubitemid 41439648)
- (2005) Lecture Notes in Computer Science , vol.3580 , pp. 1089-1101
- Abdulla, P.A.¹ Deneux, J.² Ouaknine, J.³ Worrell, J.⁴

2
- 84857148296
- Data monoids
- M. Bojańczyk. Data monoids. In STACS, 2011.
- (2011) STACS
- Bojańczyk, M.¹

3
- 84857168036
- Languages with group actions
- M. Bojańczyk, B. Klin, and S. Lasota. Languages with group actions. In LICS, 2011.
- (2011) LICS
- Bojańczyk, M.¹ Klin, B.² Lasota, S.³

4
- 0002824996
- On equations for regular languages, finite automata, and sequential networks
- J. A. Brzozowski and E. L. Leiss. On equations for regular languages, finite automata, and sequential networks. Theor. Comput. ScL, 10:19 - 35, 1980.
- (1980) Theor. Comput. ScL , vol.10 , pp. 19-35
- Brzozowski, J.A.¹ Leiss, E.L.²

5
- 84976760215
- Alternation
- A. K. Chandra, D. Kozen, and L. J. Stockmeyer. Alternation. J. ACM, 28(1):114-133, 1981.
- (1981) J. ACM , vol.28 , Issue.1 , pp. 114-133
- Chandra, A.K.¹ Kozen, D.² Stockmeyer, L.J.³

6
- 67249143974
- LTL with the freeze quantifier and register automata
- S. Demri and R. Lazic. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log., 10(3), 2009.
- (2009) ACM Trans. Comput. Log. , vol.10 , Issue.3
- Demri, S.¹ Lazic, R.²

7
- 84948955465
- Minimizing transition systems for name passing calculi: A co-algebraic formulation
- of
- G. L. Ferrari, U. Montanari, and M. Pistore. Minimizing transition systems for name passing calculi: A co-algebraic formulation. In FoSSaCS, volume 2303 of LNCS, pages 129-158, 2002.
- (2002) FoSSaCS , vol.2303 , pp. 129-158
- Ferrari, G.L.¹ Montanari, U.² Pistore, M.³

8
- 84996504294
- Relating timed and register automata
- of EPTCS
- D. Figueira, P. Hofman, and S. Lasota. Relating timed and register automata. In Proc. EXPRESS'10, volume 41 of EPTCS, pages 61-75, 2010.
- (2010) Proc. EXPRESS'10 , vol.41 , pp. 61-75
- Figueira, D.¹ Hofman, P.² Lasota, S.³

9
- 0003816315
- North-Holland
- R. Fraïssé. Theory of relations. North-Holland, 1953.
- (1953) Theory of Relations.
- Fraïssé, R.¹

10
- 0028542586
- Finite-memory automata
- N. Francez and M. Kaminski. Finite-memory automata. Theor. Comput. ScL, 134(2):329-363, 1994.
- (1994) Theor. Comput. ScL , vol.134 , Issue.2 , pp. 329-363
- Francez, N.¹ Kaminski, M.²

11
- 23944501086
- A new approach to abstract syntax with variable binding
- DOI 10.1007/s001650200016
- M. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Asp. Comput., 13(3-5):341-363, 2002. (Pubitemid 41204157)
- (2002) Formal Aspects of Computing , vol.13 , Issue.3-5 , pp. 341-363
- Gabbay, M.J.¹ Pitts, A.M.²

12
- 24644477667
- Alternating timed automata
- Foundations of Software Science and Computational Structures - 8th Int. Conference, FOSSACS 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Proc.
- S. Lasota and I. Walukiewicz. Alternating timed automata. In FoSSaCS, pages 250-265, 2005. (Pubitemid 41273711)
- (2005) Lecture Notes in Computer Science , vol.3441 , pp. 250-265
- Lasota, S.¹ Walukiewicz, I.²

13
- 42149167521
- Alternating timed automata
- S. Lasota and I. Walukiewicz. Alternating timed automata. ACM Trans. Comput. Log., 9(2), 2008.
- (2008) ACM Trans. Comput. Log. , vol.9 , Issue.2
- Lasota, S.¹ Walukiewicz, I.²

14
- 24944462836
- History-dependent automata: An introduction
- Formal Methods for Mobile Computing: 5th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM-Moby 2005, Advanced Lectures
- U. Montanari and M. Pistore. History-dependent automata: An introduction. In SFM, pages 1-28, 2005. (Pubitemid 41312734)
- (2005) Lecture Notes in Computer Science , vol.3465 , pp. 1-28
- Montanari, U.¹ Pistore, M.²

15
- 26844525115
- On the decidability of metric temporal logic
- Proceedings - 20th Annual IEEE symposium on Logic in Computer Science, LICS 2005
- J. Ouaknine and J. Worrell. On the decidability of metric temporal logic. In LICS, pages 188-197, 2005. (Pubitemid 41462566)
- (2005) Proceedings - Symposium on Logic in Computer Science , pp. 188-197
- Ouaknine, J.¹ Worrell, J.²

16
- 2542433777
- PhD thesis, University of Pisa
- M. Pistore. History Dependent Automata. PhD thesis, University of Pisa, 1999.
- (1999) History Dependent Automata
- Pistore, M.¹

17
- 23844513721
- The fresh approach: Functional programming with names and binders
- Computer Laboratory, February
- M. R. Shinwell. The Fresh Approach: functional programming with names and binders. Technical Report UCAM-CL-TR-618, University of Cambridge, Computer Laboratory, February 2005.
- (2005) Technical Report UCAM-CL-TR-618, University of Cambridge
- Shinwell, M.R.¹

18
- 32044474003
- Fresh objective caml user manual
- February
- M. R. Shinwell and A. M. Pitts. Fresh Objective Caml user manual. Technical Report UCAM-CL-TR-621, University of Cambridge Computer Laboratory, February 2005.
- (2005) Technical Report UCAM-CL-TR-621, University of Cambridge Computer Laboratory
- Shinwell, M.R.¹ Pitts, A.M.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.