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

메뉴 건너뛰기

Journal of Symbolic Computation

Volumn 32, Issue 4, 2001, Pages 403-445

A general framework to build contextual cover set induction provers

(1) Stratulat, Sorin a

a LORIA (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035197790 PISSN: 07477171 EISSN: None Source Type: Journal
DOI: 10.1006/jsco.2000.0469 Document Type: Article

Times cited : (37)

References (54)

1
- 49249149042
- Mechanizing structural induction
- (1979) Theor. Comput. Sci , vol.9 , pp. 329-362
- Aubin, R.¹

2
- 0006762638
- Theorem proving in hierarchical clausal specifications
- (1997) Advances in Algorithms, Languages, and Complexity , pp. 1-51
- Avenhaus, J.¹ Madlener, K.²

3
- 0024126961
- Proof by consistency in equational theories
- Edinburgh
- (1988) Proceedings of the 3rd IEEE Symposium on Logic in Computer Science , pp. 228-233
- Bachmair, L.¹

4
- 85028475298
- Buchberger's algorithm: A constraint-based completion procedure
- LNCS 845, Springer
- (1994) Constraints in Computational Logic, First International Conference CCL'94 , pp. 285-301
- Bachmair, L.¹ Ganzinger, H.²

5
- 0003512241
- of Graduate Texts in Mathematics. Berlin, Springer
- (1993) Gröbner Bases: A Computational Approach to Commutative Algebras , vol.141
- Becker, T.¹ Weispfenning, V.²

6
- 21844482441
- Behavioural approaches to algebraic specifications: A comparative study
- (1994) Acta Inform , vol.31 , pp. 651-671
- Bernot, G.¹ Bidoit, M.² Knapik, T.³

7
- 84957068625
- Observational proofs with critical contexts
- LNCS 1382, Berlin, Springer
- (1998) Fundamental Approaches to Software Engineering (FASE'98) , pp. 38-53
- Berregeb, N.¹ Bouhoula, A.² Rusinowitch, M.³

8
- 0000206667
- Proof by consistency in conditional equational theories
- 2nd International Workshop, LNCS
- (1990) Conditional and Typed Rewriting Systems , vol.516 , pp. 194-205
- Bevers, E.¹ Lewi, J.²

9
- 84959697692
- On the structure of abstract algebras
- (1935) Proceedings of the Cambridge Philosophical Society , vol.31 , pp. 433-454
- Birkhoff, G.¹

10
- 85031488994
- STeP. The Stanford Temporal Prover, Version 1.0, Computer Science Department, Stanford University
- (1995)
- Bjoner, N.¹

11
- 85031478657
- Private communication
- (1998)
- Bjørner, N.¹

12
- 0030402474
- Using induction and rewriting to verify and complete parameterized specifications
- (1996) Theor. Comput. Sci , vol.1-2 , pp. 245-276
- Bouhoula, A.¹

13
- 0030641947
- Automated theorem proving by test set induction
- (1997) J. Symb. Comput , vol.23 , pp. 47-77
- Bouhoula, A.¹

14
- 0001728039
- Automated mathematical induction
- (1995) J. Logic Comput , vol.5 , pp. 631-668
- Bouhoula, A.¹ Kounalis, E.² Rusinowitch, M.³

15
- 0002663288
- Automatic case analysis in proof by induction
- (1993) 13th IJCAI Conference , vol.1 , pp. 88-94
- Bouhoula, A.¹ Rusinowitch, M.²

16
- 0000491397
- Implicit induction in conditional theories
- (1995) J. Autom. Reasoning , vol.14 , pp. 189-235
- Bouhoula, A.¹ Rusinowitch, M.²

17
- 0006803695
- (1995) SPIKE-User Manual
- Bouhoula, A.¹ Rusinowitch, M.²

18
- 0004185183
- A Computational Logic
- New York, Academic
- (1979)
- Boyer, R.S.¹ Moore, J.S.²

19
- 0001013288
- MJRTY-A fast majority vote algorithm
- Boyer, R.S. ed., of Automated Reasoning, Boston, Kluwer Academic Publishers
- (1991) Automated Reasoning: Essays in Honor of Woody Bledsoe , vol.1 , pp. 105-117
- Boyer, R.S.¹ Moore, J.S.²

20
- 85032879794
- Conditional rewriting in focus
- In Proceedings of the 2nd CTRS Workshop, LNCS
- (1991) , vol.449 , pp. 2-13
- Bronsard, F.¹ Reddy, U.²

21
- 0030100851
- Induction using term orders
- (1996) J. Symb. Comput , vol.16 , pp. 3-37
- Bronsard, F.¹ Reddy, U.² Hasker, R.W.³

22
- 85031808670
- Extensions to the rippling-out tactic for guiding inductive proofs
- LNCS
- (1989) 10th International Conference on Automated Deduction , vol.449 , pp. 132-146
- Bundy, A.¹ Van Harmelen, F.² Smaill, A.³ Ireland, A.⁴

23
- 0001138255
- Orderings for term-rewriting systems
- (1982) Theor. Comput. Sci , vol.17 , pp. 279-301
- Dershowitz, N.¹

24
- 0018504528
- Proving termination with multiset orderings
- (1979) Commun. ACM , vol.22 , pp. 465-476
- Dershowitz, N.¹ Manna, Z.²

25
- 0004006994
- of Monographs on Theoretical Computer Science. Berlin, Springer
- (1985) Fundamentals of Algebraic Specification 1. Equations and Initial Semantics , vol.6
- Ehrig, H.¹ Mahr, B.²

26
- 84977878238
- A strong restriction of the inductive completion procedure
- (1989) J. Symb. Comput , vol.8 , pp. 253-276
- Fribourg, L.¹

27
- 85034667999
- Inductive methods for reasoning about abstract data types
- (1988) ACM Symposium on Principles of Programming Languages , pp. 219-228
- Garland, S.J.¹ Guttag, J.V.²

28
- 0002424767
- New Jersey, USA, Prentice-Hall
- (1978) Current Trends in Programming Methodology , vol.4
- Goguen, J.A.¹ Thatcher, J.W.² Wagner, E.G.³

29
- 0006796682
- UNICOM: A refined completion based inductive theorem prover
- (July). Stickel, M. E. ed., LNAI Berlin, Springer
- (1989) Proceedings of the 10th International Conference on Automated Deduction , vol.449 , pp. 655-656
- Gramlich, B.¹

30
- 0346910051
- Reasoning about functional programs in Nuprl
- LNCS
- (1993) Functional Programming, Concurrency, Simulation and Reasoning , vol.693 , pp. 145-164
- Howe, D.J.¹

31
- 0000673198
- Proofs by induction in equational theories with constructors
- (October)
- (1982) J. Comput. Syst. Sci , vol.25 , pp. 239-266
- Huet, G.¹ Hullot, J.-M.²

32
- 0003675111
- Cornell University
- (1994) The NUPRL Proof Development System. Version 4.1 Reference Manual and User's Guide
- Jackson, P.B.¹

33
- 0024701540
- Automatic proofs by induction in theories without constructors
- (1989) Inf. Comput , vol.82 , pp. 1-33
- Jouannaud, J.-P.¹ Kounalis, E.²

34
- 0006798045
- Attempts for generalizing the recursive path ordering
- Unpublished manuscript
- (1980)
- Kamin, S.¹ Lévy, J.-J.²

35
- 0001895110
- Automating inductionless induction using test sets
- (1991) J. Symb. Comput , vol.11 , pp. 83-112
- Kapur, D.¹ Narendran, P.² Zhang, H.³

36
- 0001234966
- An overview of RRL: Rewrite Rule Laboratory
- LNCS Berlin, Springer
- (1989) International Conference on Rewriting Techniques and Its Applications(RTA-89) , vol.355 , pp. 513-529
- Kapur, D.¹ Zhang, H.²

37
- 85026857330
- Proofs in parameterized specifications
- Berlin, Springer
- (1991) RTA'4 , pp. 174-187
- Kirchner, H.¹

38
- 0002896422
- Simple word problems in universal algebras
- Leech, ed., Oxford, Pergamon
- (1970) Computational Problems in Abstract Algebra , pp. 263-297
- Knuth, D.¹ Bendix, P.²

39
- 0002874481
- Mechanizing inductive reasoning
- (June)
- (1990) Bull. Eur. Assoc. Theor. Comput. Sci , vol.41 , pp. 216-226
- Kounalis, E.¹ Rusinowitch, M.²

40
- 0000126781
- Inductive completion by ground proof transformation
- Aït-Kaci, H., Nivat, M. eds, Rewriting Techniques, Academic
- (1989) Colloquium on the Resolution of Equations in Algebraic Structures , vol.2 , pp. 211-244
- Kuchlin, W.¹

41
- 0003720332
- Amsterdam, North-Holland
- (1978) Automated Theorem Proving: A Logical Basis
- Loveland, D.¹

42
- 0019092936
- On proving inductive properties of abstract data types
- New York, ACM
- (1980) Proceedings of the 7th ACM Symposium on Principles of Programming Languages , pp. 154-162
- Musser, D.R.¹

43
- 85031480554
- On generic representation of implicit induction procedures. Technical Report CS-R9620, CWI
- (1996)
- Naidich, D.¹

44
- 85029812987
- Parameterized horn clause specifications: Proof theory and correctness
- LNCS Berlin, Springer
- (1987) Proceedings of the TAPSOFT Conference , vol.249
- Navarro, M.¹ Orejas, F.²

45
- 84944677742
- PVS: A prototype verification system
- Kapur, D. ed., LNAI Berlin, Springer
- (1992) 11th International Conference on Automated Deduction (CADE) , vol.607 , pp. 748-752
- Owre, S.¹ Rushby, J.M.² Shankar, N.³

46
- 0003758897
- Cambridge, Cambridge University Press
- (1992) Deduction and Declarative Programming
- Padawitz, P.¹

47
- 85031788351
- Term rewriting induction
- LNCS Berlin, Springer
- (1990) 10th International Conference on Automated Deduction , vol.814 , pp. 162-177
- Reddy, U.¹

48
- 0006763228
- Démonstration automatique-Techniques de réécriture. InterEditions
- (1989)
- Rusinowitch, M.¹

49
- 0000307277
- Applying semantic subsumption rules in the context of inductive proofs
- In Workshop on Integration of Deductive Systems, CADE-15
- (1998) , pp. 85-95
- Stratulat, S.¹

50
- 0006842525
- Preuves par récurrence avec ensembles couvrants contextuels. Applications à la vérification de logiciels de télécommunications
- Ph.D. Thesis, Nancy I, Université Henri Poincaré
- (2000)
- Stratulat, S.¹

51
- 0000825462
- Combining induction axioms by machine
- (1993) Proceedings of the 12th International Joint Conference on Artificial Intelligence , vol.1 , pp. 95-100
- Walther, C.¹

52
- 0006830049
- Positive/Negative-Conditional Equations: A Constructor-Based Framework for Specification and Inductive Theorem Proving
- Ph.D. Thesis, University of Kaiserslautern
- (1997)
- Wirth, C.-P.¹

53
- 85026913360
- On notions of inductive validity for first-order equational clauses
- (1994) 12th CADE Conference , pp. 162-176
- Wirth, C.-P.¹ Gramlich, B.²

54
- 84958640069
- A mechanizable induction principle for equational Specifications
- LNCS 310, Berlin, Springer
- (1988) Proceedings of the 9th International Conference on Automated Deduction, Aragonne (Illinois, USA) , pp. 162-181
- Zhang, H.¹ Kapur, D.² Krishnamoorthy, M.S.³

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