-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathjbln.bib
1423 lines (1261 loc) · 43 KB
/
jbln.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
%------------------------------------------------------------------------------
% TO BE READ LATER ON
%------------------------------------------------------------------------------
@Inproccedings{
bccz-1999-smc,
title = "Symbolic model checking without {BDD}s",
author = "Armin Biere and Alessandro Cimatti and Edmund M. Clarke and
Yunshan Zhu",
booktitle = "Tools and Algorithms for the Construction and
Analysis of Systems",
year = "1999",
pages = "192-207"
}
@InProceedings{
in-1997-fmc,
author = "H. Iwashita and T. Nakata",
title = "Forward Model Checking Techniques Oriented to Buggy Designs",
pages = "400--405",
booktitle = "Proceedings of the {IEEE}/{ACM} International
Conference on Computer-Aided Design",
publisher = "IEEE Computer Society Press",
year = "1997",
month = nov
}
@InProceedings{
jphs-1992-vob,
author = "S.-W. Jeong and B. Plessier and G. D. Hachtel and F.
Somenzi",
title = "Variable Ordering for Binary Decision Diagrams",
pages = "447--451",
ISBN = "0-8186-2645-3",
editor = "IEEE",
booktitle = "Proceedings of the European Conference on Design
Automation",
month = mar # "~16--19",
publisher = "IEEE Computer Society Press",
year = "1992",
}
@InProceedings{
nijbs-1997-rap,
title = "Reachability Analysis using Partitioned {ROBDDs}",
author = "A. Narayan and A. J. Isles and J. Jain and R. K. Brayton
and A. L. Sangiovanni-Vincentelli",
booktitle = "Proceedings of the International Conference on
Computer-Aided Design",
year = "1997",
month = nov,
publisher = "{IEEE} Computer Society Press"
}
% Paper copy
@InProceedings{
njfs-1996-prc,
author = "A. Narayan and J. Jain and M. Fujita and A.
Sangiovanni-Vincentelli",
title = "Partitioned {ROBDDs}: {A} Compact, Canonical and
Efficiently Manipulable Representation for Boolean
Functions",
pages = "547--555",
ISBN = "0-8186-7597-7",
booktitle = "Proceedings of the {IEEE}/{ACM} International
Conference on Computer-Aided Design",
month = nov # "10--14~",
publisher = "IEEE Computer Society Press",
year = "1996",
}
% Paper copy
@InProceedings{
agm-1996-ucd,
author = "P. Ashar and A. Gupta and S. Malik",
title = "Using Complete-1-Distinguishability for {FSM}
Equivalence Checking",
pages = "346--353",
ISBN = "0-8186-7597-7",
booktitle = "Proceedings of the {IEEE}/{ACM} International
Conference on Computer-Aided Design",
month = nov,
publisher = "{IEEE} Computer Society Press",
year = "1996"
}
% Paper copy
@InProceedings{
ccq-1994-ave,
author = "Gianpiero Cabodi and Paolo Camurati and Stefano Quer",
title = "Auxiliary Variables for Extending Symbolic Traversal
Techniques to Data Paths",
pages = "289--293",
ISBN = "0-89791-653-0",
editor = "Michael Lorenzetti",
booktitle = "Proceedings of the 31st Conference on Design
Automation",
month = jun,
publisher = "ACM Press",
year = "1994",
}
% Paper copy
@InProceedings{
ssb-1995-imf,
author = "{G. Swamy} and {V. Singhal} and {R.K. Brayton}",
title = "{I}ncremental {M}ethods for {FSM} {T}raversal",
booktitle = "Proceedings of the IEEE International Conference on
Computer Design (ICCD '95)",
year = "1995",
month = oct,
keyword = "verification",
}
% Not really interesting. Very short. About part. trans.rel.
@InProceedings{
bcl-1991-rcm,
author = "Jerry R. Burch and Edmund M. Clarke and David E. Long",
title = "Representing Circuits More Efficiently in
Symbolic Model Checking",
booktitle = "Proceedings of the 28th {ACM/IEEE} Automation
Conference",
year = "1991",
pages = "403--407",
publisher = "IEEE Computer Society Press",
month = jun,
}
@inproceedings{
bcl-1991-smcptr,
author="Jerry R. Burch and Edmund M. Clarke and David E. Long",
title="Symbolic Model Checking with Partitioned Transition Relations",
booktitle="Proceedings of the 1991 International Conference on {VLSI}",
month="August",
year="1991"
}
% Paper copy
@InProceedings{
cclq-1997-dpp,
title = "{Disjunctive Partitioning and Partial Iterative Squaring}",
author = "Gianpiero Cabodi and Paolo Camurati and Luciano Lavagno and Stefano Quer",
booktitle = "{Proceedings of the Design Automation Conference}",
year = "1997",
publisher = "{Association for Computing Machinery Inc.}",
pages = "728--733",
month = jun
}
% Paper copy
@InProceedings{
ccq-1996-ira,
author = "G. Cabodi and P. Camurati and S. Quer",
title = "Improved Reachability Analysis of Large Finite State
Machines",
pages = "354--360",
ISBN = "0-8186-7597-7",
booktitle = "Proceedings of the {IEEE}/{ACM} International
Conference on Computer-Aided Design",
month = nov # "10--14~",
publisher = "IEEE Computer Society Press",
year = "1996",
}
% Paper copy
@InProceedings{
hbbm-1997-sbm,
title = "{Safe BDD Minimization Using Don't Cares}",
author = "Youpyo Hong and Peter A. Beerel and Jerry R. Burch and
Kenneth L.McMillan",
pages = "208--213",
booktitle = "{Proceedings of the {IEEE}/{ACM} International Conference
on Computer-Aided Design}",
publisher = "IEEE Computer Society Press",
year = 1997,
month = nov
}
% Paper copy
@InProceedings{
rs-1995-hdr,
author = "Kavita Ravi and Fabio Somenzi",
title = "High-Density Reachability Analysis",
pages = "154--158",
booktitle = "International Conference on Computer Aided Design",
month = nov,
publisher = "IEEE Computer Society Press",
year = "1995",
ISBN = "0-8186-7213-7",
}
% The restrict/simplify BDD operation. Paper copy
@InProceedings{
cm-1990-uff,
author = "O. Coudert and J. C. Madre",
title = "A Unified Framework for the Formal Verification of
Sequential Circuits",
pages = "126--129",
ISBN = "0-8186-2055-2",
editor = "Satoshi {Sangiovanni-Vincentelli, Alberto; Goto}",
booktitle = "Proceedings of the {IEEE} International Conference on
Computer-Aided Design",
month = nov,
year = "1990",
publisher = "IEEE Computer Society Press",
}
% The restrict/simplify BDD operation
@InProceedings{
cbm-1990-vss,
author = "O. Coudert and C. Berthet and J. C. Madre",
title = "Verification of Synchronous Sequential Machines Based
on Symbolic Execution",
pages = "365--373",
ISBN = "3-540-52148-8",
editor = "J. Sifakis",
booktitle = "Proceedings of the International Workshop on Automatic
Verification Methods for Finite State Systems",
month = jun,
series = "Lecture Notes in Computer Science",
volume = "407",
publisher = "Springer",
year = "1990",
}
% Paper copy and postscript file
@TechReport{
rabpp-1994-efd,
title = "{Efficient Formal Design Verification:
Data Structure + Algorithms}",
author = "Rajeev K. Ranjan and Adnan Aziz and Bernard Plessier
and Carl Pixley and R. K. Brayton",
number = "UCB/ERL M94",
institution = "{Electronics Research Lab,
University of California, Berkeley}",
month = oct,
year = 1994
}
@InProceedings{
lps-1981-ijf,
title = "Impartiality, Justice and Fairness: The Ethics of
Concurrent Termination",
author = "Daniel J. Lehmann and Amir Pnueli and Jonathan Stavi",
booktitle = "Automata, Languages and Programming, 8th Colloquium",
month = "july",
year = "1981",
series = "Lecture Notes in Computer Science",
volume = "115",
publisher = "Springer-Verlag",
pages = "264--277",
}
@inbook{
mp-1992-tlrcs,
title = "The Temporal Logic of Reactive and Concurrent Systems:
Specification.",
author = "Zohar Manna and Amir Pnueli",
year = "1992",
publisher = "Springer-Verlag"
}
@InProceedings{
minato-1993-zdd,
author = "{Shin-Ichi} Minato",
title = "Zero-Suppressed {BDDs} for Set Manipulation in
Combinatorial Problems",
pages = "272--277",
booktitle = "Proceedings of the 30th {ACM}/{IEEE} Design Automation
Conference",
month = jun,
year = "1993",
publisher = "ACM Press",
}
@Inproceedings{
bfghmps-1993-add,
author = "R. Iris Bahar and Erica A. Frohm and Charles M. Gaona and
Gary D. hatchel and Enrico Macii and Abelardo Pardo and
Fabio Somenzi",
title = "Algebraic Decision Diagrams and their applications",
pages = "188--191",
booktitle = "Proceedings of the International Conference on Computer-Aided
Design",
year = "1993",
month = "november"
}
@InProceedings{
ah-1997-bed,
author = "Henrik Reif Andersen and Henrik Hulgaard",
title = "Boolean Expression Diagrams",
pages = "88--98",
booktitle = "12th Annual {IEEE} Symposium on Logic in Computer
Science",
month = "june",
year = "1997"
}
%------------------------------------------------------------------------------
% TCAS
%------------------------------------------------------------------------------
@InProceedings{
cabn-1998-ies,
author = "William Chan and Richard J. Anderson and Paul Beame
and David Notkin",
title = "Improving Efficiency of Symbolic Model Checking for
State-Based System Requirements",
pages = "102--112",
ISSN = "0163-5948",
booktitle = "Proceedings of the {ACM} {SIGSOFT} International
Symposium on Software Testing and Analysis
({ISSTA}-98)",
month = mar # "2--5~",
series = "ACM Software Engineering Notes",
volume = "23,2",
publisher = "ACM Press",
year = "1998",
}
@TechReport{
lhhr-1992-rspcs,
type = "Technical Report",
number = "ICS-TR-92-106",
title = "Requirements Specification for Process-Control
Systems",
language = "English",
month = nov,
pages = "54",
year = "1992",
bibdate = "March 22, 1995",
author = "Nancy G. Leveson and Mats P. E. Heimdahl and Holly
Hildreth and Jon D. Reese",
abstract = "This paper describes an approach to writing
requirements specifications for process-control
systems, a specification language that supports this
approach, and an example application of the approach
and the language on an industrial aircraft collision
avoidance system (TCAS II). The example specification
demonstrates (1) the practicality of writing a formal
requirements specification for a complex,
process-control system and (2) the feasibility of
building a formal model of a system using a
specification language that is readable and reviewable
by applications experts who are not computer scientists
or mathematicians. Some lessons learned in the process
of this work, which are applicable both to forward and
reverse engineering, are also presented. Index Terms:
process control, reactive systems, requirements,
blackbox specifications, formal methods, safety
analysis, reverse engineering",
institution = "University of California, Irvine, Department of
Information and Computer Science",
}
%------------------------------------------------------------------------------
% BDDs and abstractions or approximations
%------------------------------------------------------------------------------
@Inproceedings{
gd-1998-vaf,
title = "Verification by approximate forward and backward reachability",
author = "Shankar G. Govindaraju and David L. Dill",
booktitle = "IEEE/ACM International Conference on Computer-Aided Design",
year = "1998",
pages = "366--370"
}
@Inproceedings{
gdhh-1998-arb,
title = "Approximate reachability with {BDD}s using overlapping
projections",
author = "Shankar G. Govindaraju and David L. Dill and Alan J. Hu and
Mark A. Horowitz",
booktitle = "Proceedings 1998 Design and Automation Conference. 35th DAC",
year = "1998",
pages = "451--456"
}
@Inproceedings{
cgl-1992-mca,
title = {Model Checking and Abstration},
author = {Edmund M. Clarke, Orna Grumberg, David E. Long},
year = {1992},
booktitle = {Proceedings of the nineteenth Annual {ACM} Symposium on Principles of Programming Languages}
}
@phdthesis{
l-1993-macv,
title = {Model Checking, Abstraction and Compositional Verification},
author = { David E. Long },
school = { Carnegie Mellon},
year = 1993
}
@Inproceedings{
ah-1997-aat,
title = {Automatic Abstraction Techniques for Propositional $\mu$-calculus
Model Checking},
author = {Abelardo Pardo and Gary D. Hachtel},
year = {1997},
booktitle = {Computer Aided Verification},
series = "Lecture Notes in Computer Science",
pages = "12--23",
publisher = {Springer Verlag}
}
% Paper copy and postscript file
@Inproceedings{
rappb-1995-eba,
title = {Efficient {BDD} Algorithms for {FSM} Synthesis and Verification},
author = {Rajeev K. Ranjan and Adnan Aziz and Bernard Plessier and
Carl Pixley and Robert K. Brayton},
booktitle = {{IEEE/ACM} International Workshop on Logic Synthesis},
year = {1995},
month = {may}
}
% Paper copy
@Article{
chmps-1996-asp,
title = {Automatic State Space Decomposition for Approximate {FSM}
Traversal Based on Circuit Analysis},
author = {Hyunwoo Cho and Gary D. Hatchel and Enrico Macii and
Massimo Poncino and Fabio Somenzi},
journal = {{IEEE} Transactions on Computer Aided Design of Integrated
Circuits and Systems},
year = {1996},
month = {december},
volume = {15},
number = {12},
pages = {1451--1464}
}
% Paper copy
@InProceedings{
ssb-95-imft,
author = "{G. Swamy} and {V. Singhal} and {R.K. Brayton}",
title = "{I}ncremental {M}ethods for {FSM} {T}raversal",
booktitle = "Proceedings of the IEEE International Conference on
Computer Design (ICCD '95)",
year = "1995",
month = oct,
}
@InProceedings{
ccq-1994-essp,
author = "Gianpiero Cabodi and Paolo Camurati and Stefano Quer",
title = "Efficient State Space Pruning in Symbolic
Backward Traversal",
booktitle = "Proceedings of the International Conference on
Computer Design",
year = "1994",
month = oct,
}
@InProceedings{
chmps-1993-aaft,
author = "H. Cho and G. D. Hachtel and E. Macii and B. Plessier
and F. Somenzi",
title = "Algorithms for Approximate {FSM} Traversal",
pages = "25--30",
ISBN = "0-89791-577-1",
editor = "ACM-SIGDA; IEEE",
booktitle = "Proceedings of the 30th {ACM}/{IEEE} Design Automation
Conference",
month = jun,
year = "1993",
publisher = "ACM Press",
}
%------------------------------------------------------------------------------
% BDDs and dependencies
%------------------------------------------------------------------------------
% Paper copy
@InProceedings{
hudill-1993-rbs,
author = "A. J. Hu and D. L. Dill",
title = "Reducing {BDD} Size by Exploiting Functional
Dependencies",
pages = "266--271",
ISBN = "0-89791-577-1",
editor = "ACM-SIGDA; IEEE",
booktitle = "Proceedings of the 30th {ACM}/{IEEE} Design Automation
Conference",
month = jun,
year = "1993",
publisher = "ACM Press",
}
% Paper copy
@InProceedings{
hyd-1994-nte,
author = "A.J. Hu and G. York and D.L. Dill",
title = "New Techniques for Efficient Verification with
Implicity Conjoined {BDD}s",
booktitle = "31st ACM/IEEE Design Automation Conference (DAC)",
year = "1994",
publisher = "San Diego Convention Center",
month = jun,
key = "HuYD94",
keyword = "BDD_techniques_and_formal_verification",
owner = "Thomas Kropf",
}
% Paper copy
@InProceedings{
bs-1993-ialc,
author = "Felice Balarin and Alberto L. Sangiovanni-Vincentelli",
title = "An Iterative Approach to Language Containment",
booktitle = "5th International Conference on Computer Aided Verification",
volume = 697,
series = "Lecture Notes in Computer Science",
year = 1993,
publisher = "Springer-Verlag",
pages = "29--40"
}
%------------------------------------------------------------------------------
% BDDs and partitions
%------------------------------------------------------------------------------
% Paper copy
@Inproceedings{
gb-1994-efc,
author = "Danial Geist and Ilan Beer",
title = "Efficient Model Checking by Automated Ordering of
Transition Relation Partitions",
booktitle = "6th. International Conference on Computer Aided Verification"
series = "Lecture Notes in Computer Science",
volume = "818",
pages = "299--310",
year = "1994",
}
%------------------------------------------------------------------------------
% Strictly BDDs
%------------------------------------------------------------------------------
@Unpublished{
bdd-1997-hra,
author = "Henrik Reif Andersen",
title = "An Introduction to Binary Decision Diagrams",
note = "\\\verb+http://www.itu.dk/people/hra/notes-index.html+",
year = "1997"
}
@Techreport{
buddy,
author = "J\o{}rn Lind-Nielsen",
title = "\name{BuDDy} - A Binary Decision Diagram Package",
year = "1999",
institution = "Institute of Information Technology, Technical University of Denmark",
number = "IT-TR: 1999-028",
note = "\verb+http://www.itu.dk/research/buddy+"
}
@Manual{
cudd,
author = "Fabio Somenzi",
title = "CUDD: CU Decision Diagram Package",
year = "1997",
organization = "University of Colorado at Boulder",
note = "\verb+http://vlsi.colorado.edu/~fabio+"
}
@Manual{
cmubdd,
author = "David E. Long",
title = "BDD - a binary decision diagram package",
year = "1993",
organization = "Carnigie Mellon University",
note = "\\\verb+http://www.cs.cmu.edu/afs/cs/project/modck/pub/www/bdd.html+"
}
@Inproceedings{
calbdd,
author = "Jagesh V. Sanghavi and Rajeev K. Ranjan and
Robert K. Brayton and Alberto Sangiovanni-Vincentelli",
title = "High Performance {BDD} Package Based on Exploiting
Memory Hierarchy",
booktitle = "{ACM/IEEE} Design Automation Conference",
year = "1996",
month = "june",
note = "\\\verb+http://www-cad.eecs.berkeley.edu/Respep/Research/cal_bdd+"
}
@InProceedings{
bcmd-1990-scv,
author = "Jerry R. Burch and Edmund M. Clarke and Kenneth L. McMillan
and David L. Dill",
title = "Sequential Circuit Verification Using
Symbolic Model Checking",
booktitle = "Proceedings of the 27th {ACM/IEEE} Design Automation
Conference",
year = "1990",
pages = "46--51",
month = "june",
}
@InProceedings{tslbs-1990-ise,
author = "H. J. Touati and H. Savoj and B. Lin and R. K. Brayton
and A. Sangiovanni-Vincentelli",
title = "Implicit State Enumeration of Finite State Machines
Using {BDDs}",
pages = "130--133",
ISBN = "0-8186-2055-2",
editor = "Satoshi {Sangiovanni-Vincentelli, Alberto; Goto}",
booktitle = "Proceedings of the {IEEE} International Conference on
Computer-Aided Design",
month = nov,
year = "1990",
publisher = "IEEE Computer Society Press"
}
% Paper copy
@Article{
bryant-1992-sbm,
author = "Randal E. Bryant",
title = "Symbolic {Boolean} Manipulation with Ordered
Binary Decision Diagrams",
journal = "ACM Computing Surveys",
volume = "24",
number = "3",
pages = "293--318",
month = sep,
year = "1992",
coden = "CMSVAN",
ISSN = "0360-0300",
bibdate = "Sun Sep 25 10:21:25 1994",
abstract = "Ordered Binary-Decision Diagrams (OBDDs) represent
Boolean functions as directed acyclic graphs. They form
a canonical representation, making testing of
functional properties such as satisfiability and
equivalence straightforward. A number of operations on
Boolean functions can be implemented as graph
algorithms on OBDD data structures. Using OBDDs, a wide
variety of problems can be solved through {\em symbolic
analysis}. First, the possible variations in system
parameters and operating conditions are encoded with
Boolean variables. Then the system is evaluated for all
variations by a sequence of OBDD operations.
Researchers have thus solved a number of problems in
digital-system design, finite-state system analysis,
artificial intelligence, and mathematical logic. This
paper describes the OBDD data structure and surveys a
number of applications that have been solved by
OBDD-based symbolic analysis.",
}
% Paper copy
@InProceedings{
bryant-1990-eib,
author = "Karl S. Brace and Richard L. Rudell and Randal E. Bryant",
title = "Efficient Implementation of a {BDD} Package",
booktitle = "27th {ACM/IEEE} Design Automation Conference",
year = "1990",
pages = "40--45",
publisher = "IEEE Computer Society Press",
month = jun,
key = "BrRB90",
keyword = "formalism propositionallogic BDD",
owner = "Thomas Kropf, J{\"u}rgen Fr{\"o}{\ss}l",
}
% Paper copy
@InProceedings{
rudell-1993-dvo,
author = "Richard L. Rudell",
title = "Dynamic Variable Ordering for Ordered Binary
Decision Diagrams",
booktitle = "{IEEE} /{ACM} International Conference on {CAD}",
year = "1993",
pages = "42--47",
publisher = "IEEE Computer Society Press",
month = nov,
key = "Rude93",
keyword = "BDD",
owner = "Uni-Bib: 94E328",
}
% Paper copy
@Article{
bryant-1986-gba,
author = "Randal E. Bryant",
title = "Graph-Based Algorithms for Boolean Function
Manipulation",
journal = "IEEE Transactions on Computers",
year = "1986",
volume = "C-35",
number = "8",
pages = "677--691",
month = "august",
}
% Paper copy
@Article{
sentovich-1996-bsb,
author = "E. M. Sentovich",
title = "A Brief Study of {BDD} Package Performance",
journal = "Lecture Notes in Computer Science",
volume = "1166",
pages = "389--??",
year = "1996",
coden = "LNCSD9",
ISSN = "0302-9743",
bibdate = "Sat Dec 21 09:47:26 1996",
acknowledgement = ack-nhfb,
}
% Paper copy
@InProceedings{
atb-1994-bvo,
author = "{A. Aziz} and {S. Tasiran} and {R.K. Brayton}",
title = "BDD Variable Ordering for Interacting Finite
State Machines",
booktitle = "31st ACM/IEEE Design Automation Conference",
year = "1994",
month = jun,
}
% About memory caching schemes and BDD performance. Compares CUDD, LONG
% and CAL.
@InProceedings{
mgs-1997-rtp,
title = "{Remembrance of Things Past: Locality and Memory in BDDs}",
author = "Srilatha Manne and Dirk Grunwald and Fabio Somenzi",
booktitle = "{Proceedings of the Design Automation Conference}",
year = "1997",
publisher = "{Association for Computing Machinery Inc.}",
month = jun
}
@Article{
bcmdh-92-smc,
title = "Symbolic Model Checking: $10^{20}$ States and Beyond",
author = "Jerry R. Burch and Edmund M. Clarke and Kennth L. McMillan
and David L. Dill and L. J. Hwang",
pages = "142--170",
journal = "Information and Computation",
month = jun,
year = "1992",
volume = "98",
number = "2"
}
% Paper copy
@Article{
bclmd-1994-smc,
author = "Jerry R. Burch and Edmund M. Clarke and David E. Long and
Kenneth L. MacMillan and David L. Dill",
title = "Symbolic Model Checking for Sequential Circuit
Verification",
journal = "IEEE Transactions on Computer-Aided Design of
Integrated Circuits and Systems",
year = "1994",
volume = "13",
number = "4",
pages = "401--424",
month = apr,
key = "BCLM94",
keyword = "hardware gatelevel verification formalism
temporallogic modelchecking",
}
%------------------------------------------------------------------------------
% CTL/LTL verification
%------------------------------------------------------------------------------
% The CTL* source
@Article{
eh-1986-snn,
author = "E. Allen Emerson and Joseph Y. Halpern",
title = "`{S}ometimes' and `Not Never' Revisited: on Branching
Time versus Linear Time Temporal Logic",
journal = "Journal of the ACM",
volume = "33",
number = "1",
pages = "151--178",
year = "1986",
}
@article{
gupta-1992-fhv,
author = "Aarti Gupta",
title = "Formal Hardware Verification Methods: A Survey",
journal = "Formal Methods in System Design",
year = "1992",
volume = "1",
number = "1",
pages = "151--238",
month = "july"
}
@InProceedings{
lpjhs-1996-tba,
author = "Woohyuk Lee and Abelardo Pardo and JaeYoung Jang and
Gary Hachtel and Fabio Somenzi",
title = "Tearing Based Automatic Abstraction for {CTL} Model
Checking",
pages = "76--81",
ISBN = "0-8186-7597-7",
booktitle = "Proceedings of the {IEEE}/{ACM} International
Conference on Computer-Aided Design",
month = nov # "10--14~",
publisher = "IEEE Computer Society Press",
year = "1996",
}
% Paper copy
@InProceedings{
inh-1996-mcb,
author = "H. Iwashita and T. Nakata and F. Hirose",
title = "{CTL} Model Checking Based on Forward State Traversal",
pages = "82--87",
ISBN = "0-8186-7597-7",
booktitle = "Proceedings of the {IEEE}/{ACM} International
Conference on Computer-Aided Design",
month = nov,
publisher = "IEEE Computer Society Press",
year = "1996",
}
% Paper copy
@Inproceedings{
zhang-1995-ahm,
title = {An Approach to Hierarchy Model Checking via Evaluating
{CTL} Hierarchially},
author = {Zuan Zhang},
booktitle = {The Fourth Asian Test Symposium},
publisher = {IEEE Computer Soc. Press},
year = {1995},
pages = {45--49}
}
@Article{
ces-1986-avf,
author = "Edmund M. Clarke and E. Allen Emerson and A. Prasad Sistla",
title = "Automatic Verification of Finite-State Concurrent
Systems Using Temporal Logic Specifications",
journal = "ACM Transactions on Programming Languages and
Systems",
volume = "8",
number = "2",
pages = "244--263",
month = apr,
year = "1986",
}
@phdthesis{
smv,
author = "Kenneth L. McMillan",
title = "{Symbolic Model Checking: An Approach to the State Space
Explosion Problem}",
school = "{Carnegie Mellon University}",
year = "1998",
note = "\\\verb+http://www.cs.cmu.edu/~modelcheck/smv.html+",
}
@article{
cgh-all-1994,
author = "Edmund M. Clarke and Orna Grumberg and Kiyoharu Hamaguchi",
title = "Another Look at {LTL} Model Checking",
journal = "Lecture Notes in Computer Science",
volume = "818",
pages = "415--427",
year = "1994"
}
@article{
sc-cpl-1986,
author = "A. Prasad Sistla and Edmund M. Clarke",
title = "The Complexity of Propositional Linear Temporal
Logics",
journal = "Journal of Association Computing Machinery",
year = "1986",
volume = "32",
number = "3",
pages = "733--749",
month = "july",
}
@inproceedings{
lp-1985-cfs,
author = "Orna Lichtenstein and Amir Pnueli",
title = "Checking that Finite State Concurrent Programs Satisfy
their Linear Specifications",
booktitle = "Conference Record of the Twelfth Annual {ACM}
Symposium on Principles of Programming Languages",
publisher = "ACM",
month = jan,
year = "1985",
pages = "97--107"
}
@inproceedings{
nccf,
title = "The Concurrency Factory --- Practical Tools for Specification,
Simulation, Verification, and Implementation of
Concurrent Systems",
author = "Rance Cleaveland and Jayesh N. Gada and P. M. Lewis and
Scott A. Smolka and Oleg Sokolsky and {ShiPei} Zhang",
booktitle = "Proceedings of DIMACS Workshop on Specification of Parallel
Algorithms",
volume = "18",
pages = "75--90",
month = "May",
year = "1994",
note = "\verb+http://www.cs.sunysb.edu/~concurr+"
}
@article{
spin,
title = "The Spin Model Checker",
author = "Gerard J. Holzmann",
journal = "IEEE Transactions on Software Engineering",
volume = "23",
number = "5",
month = "May",
year = "1997",
pages = "279--295",
note = "\\\verb+http://netlib.bell-labs.com/netlib/spin/whatispin.html+"
}
%------------------------------------------------------------------------------
% Partial model checking
%------------------------------------------------------------------------------
% Paper copy
@Article{
asm-1997-pmc,
author = "Henrik Reif Andersen and J\o{}rgen Staunstrup and
Niels Maretti",
title = "Partial Model Checking with {ROBDDs}",
journal = "Lecture Notes in Computer Science",
volume = "1217",
pages = "35--49",
year = "1997",
}
@InProceedings{
andersen-1995-pmc,
author = "Henrik Reif Andersen",
title = "Partial Model Checking",
pages = "398--407",
booktitle = "Symposium on Logic in Computer Science",
month = "june",
publisher = "IEEE Computer Society Press",
year = "1995",
}
%------------------------------------------------------------------------------
% Verification in general
%------------------------------------------------------------------------------
%------------------------------------------------------------------------------
% My own
%------------------------------------------------------------------------------
@MastersThesis{
jl-master-thesis,
author = {J\o{}rn Lind-Nielsen},
title = {\name{MuDiv}: A Program Performing Partial Model Checking},
school = {Department of Information Technology, Technical University of
Denmark},
year = 1996,
month = {September},
address = {Building 344, DK-2800 Lyngby, Denmark},
note = {\\\verb+http://www.it.dtu.dk/~jl+}
}